default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Complexity, Volume 26
Volume 26, Number 1, March 2017
- Igor Pak, Greta Panova:
On the complexity of computing Kronecker coefficients. 1-36 - Eli Ben-Sasson, Noga Ron-Zewi
, Madhu Sudan:
Sparse affine-invariant linear codes are locally testable. 37-77 - Baris Aydinlioglu, Dieter van Melkebeek:
Nondeterministic circuit lower bounds from mildly derandomizing Arthur-Merlin games. 79-118 - Salman Beigi, Omid Etesami, Amin Gohari:
The Value of Help Bits in Randomized and Average-Case Complexity. 119-145 - Gábor Braun, Rahul Jain, Troy Lee, Sebastian Pokutta:
Information-theoretic approximations of the nonnegative rank. 147-197 - Rahul Jain, Zhaohui Wei, Penghui Yao, Shengyu Zhang:
Multipartite Quantum Correlation and Communication Complexities. 199-228 - Amir Shpilka, Avishay Tal, Ben lee Volk:
On the Structure of Boolean Functions with Small Spectral Norm. 229-273 - Russell Impagliazzo, Valentine Kabanets:
Fourier Concentration from Shrinkage. 275-321
Volume 26, Number 2, June 2017
- Frederic Green, Daniel Kreymer, Emanuele Viola:
Block-symmetric polynomials correlate with parity better than symmetric. 323-364 - Elena Grigorescu, Chris Peikert:
List-Decoding Barnes-Wall Lattices. 365-392 - Dean Doron, Amir Sarid, Amnon Ta-Shma:
On Approximating the Eigenvalues of Stochastic Matrices in Probabilistic Logspace. 393-420 - Evangelos Bampas, Andreas-Nikolas Göbel, Aris Pagourtzis, Aris Tentes:
On the connection between interval size functions and path counting. 421-467 - Eric Allender, Dhiraj Holden, Valentine Kabanets:
The Minimum Oracle Circuit Size Problem. 469-496 - Ishay Haviv, Ning Xie:
Sunflowers and Testing Triangle-Freeness of Functions. 497-530
Volume 26, Number 3, September 2017
- Dana Moshkovitz:
Low-degree test with polynomially small error. 531-582 - Eric Allender, Anna Gál, Ian Mertz:
Dual VP Classes. 583-625 - Vikraman Arvind, Johannes Köbler, Gaurav Rattan, Oleg Verbitsky:
Graph Isomorphism, Color Refinement, and Compactness. 627-685 - Andrei Gabrielov, Nicolai N. Vorobjov Jr.:
Topological lower bounds for arithmetic networks. 687-715 - Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam:
Non-commutative Edmonds' problem and matrix semi-invariants. 717-763
Volume 26, Number 4, December 2017
- Leslie Ann Goldberg, Heng Guo:
The Complexity of Approximating complex-valued Ising and Tutte partition functions. 765-833 - Rohit Gurjar, Arpita Korwar, Nitin Saxena, Thomas Thierauf:
Deterministic Identity Testing for Sum of Read-Once Oblivious Arithmetic Branching Programs. 835-880 - Priyanka Mukhopadhyay, Youming Qiao:
Sparse multivariate polynomial interpolation on the basis of Schubert polynomials. 881-909 - Massimo Lauria, Jakob Nordström:
Tight Size-Degree Bounds for Sums-of-Squares Proofs. 911-948 - Christian Ikenmeyer, Ketan D. Mulmuley, Michael Walter:
On vanishing of Kronecker coefficients. 949-992
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 2025-03-21 23:49 CET 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:
