Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Complexity, Volume 31
Volume 31, Number 1, June 2022
- Austin Conner, Fulvio Gesmundo, Joseph M. Landsberg, Emanuele Ventura
:
Rank and border rank of Kronecker powers of tensors and Strassen's laser method. 1 - Andreas Galanis, Leslie Ann Goldberg, Andrés Herrera-Poyatos:
The complexity of approximating the complex-valued Potts model. 2 - Thomas Watson:
Amplification with One NP Oracle Query. 3 - Igor C. Oliveira, Rahul Santhanam, Roei Tell:
Expander-Based Cryptography Meets Natural Proofs. 4 - Paul Görlach, Yue Ren, Leon Zhang:
Computing zero-dimensional tropical varieties via projections. 5 - Adrien Poteaux, Martin Weimann:
A quasi-linear irreducibility test in 핂[[x]][y]. 6
Volume 31, Number 2, December 2022
- Oded Goldreich:
Improved bounds on the AN-complexity of O(1)-linear functions. 7 - Prerona Chatterjee, Mrinal Kumar, Adrian She, Ben Lee Volk:
Quadratic Lower Bounds for Algebraic Branching Programs and Formulas. 8 - Anup Bhattacharya, Sourav Chakraborty, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar:
Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond. 9 - Hiroshi Hirai, Motoki Ikeda:
A cost-scaling algorithm for computing the degree of determinants. 10 - Katrin Casel, Philipp Fischbeck, Tobias Friedrich, Andreas Göbel, J. A. Gregor Lagodzinski:
Zeros and approximations of Holant polynomials on the complex plane. 11 - Mrinal Kumar, Ben Lee Volk:
A Lower Bound on Determinantal Complexity. 12 - Sevag Gharibian, Miklos Santha, Jamie Sikora, Aarthi Sundaram, Justin Yirka:
Quantum generalizations of the polynomial hierarchy with applications to QMA(2). 13 - Ishay Haviv:
The Complexity of Finding Fair Independent Sets in Cycles. 14 - Vishwas Bhargava, Sumanta Ghosh:
Improved Hitting Set for Orbit of ROABPs. 15 - Dean Doron, Amnon Ta-Shma, Roei Tell:
On Hitting-Set Generators for Polynomials that Vanish Rarely. 16 - Uma Girish, Ran Raz, Avishay Tal:
Quantum versus Randomized Communication Complexity, with Efficient Players. 17
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-06-10 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
