Linear Matroid Intersection is in Quasi-NC Rohit Gurjar Thomas Thierauf OriginalPaper 19 November 2020 Article: 9
The Computational Complexity of Plethysm Coefficients Nick Fischer Christian Ikenmeyer OriginalPaper Open access 04 November 2020 Article: 8
The Robustness of LWPP and WPP, with an Application to Graph Reconstruction Edith HemaspaandraLane A. HemaspaandraOsamu Watanabe OriginalPaper 29 October 2020 Article: 7
Two-closures of supersolvable permutation groups in polynomial time Ilia PonomarenkoAndrey Vasil’ev OriginalPaper 24 June 2020 Article: 5
Toward Better Depth Lower Bounds: Two Results on the Multiplexor Relation Or Meir OriginalPaper 06 June 2020 Article: 4
Correction to: Communication complexity with small advantage Thomas Watson Correction 30 May 2020 Article: 3
On the characterization of 1-sided error strongly testable graph properties for bounded-degree graphs Hiro ItoAreej KhouryIlan Newman OriginalPaper 20 January 2020 Article: 1
Average-case linear matrix factorization and reconstruction of low width algebraic branching programs Neeraj KayalVineet NairChandan Saha OriginalPaper 18 July 2019 Pages: 749 - 828
Simulation Theorems via Pseudo-random Properties Arkadev ChattopadhyayMichal KouckýSagnik Mukhopadhyay OriginalPaper Open access 18 July 2019 Pages: 617 - 659
A quadratic lower bound for homogeneous algebraic branching programs Mrinal Kumar OriginalPaper 08 June 2019 Pages: 409 - 435
Hierarchy Theorems for Testing Properties in Size-Oblivious Query Complexity Oded Goldreich OriginalPaper 06 June 2019 Pages: 709 - 747
Depth-4 Lower Bounds, Determinantal Complexity: A Unified Approach Suryajith ChillaraPartha Mukhopadhyay OriginalPaper 28 May 2019 Pages: 545 - 572
Improved Bounds for Quantified Derandomization of Constant-Depth Circuits and Polynomials Roei Tell OriginalPaper 22 April 2019 Pages: 259 - 343
A decidable dichotomy theorem on directed graph homomorphisms with non-negative weights Jin-Yi CaiXi Chen OriginalPaper 22 April 2019 Pages: 345 - 408
Vanishing of Littlewood–Richardson polynomials is in P Anshul AdveColleen RobichauxAlexander Yong OriginalPaper 19 April 2019 Pages: 241 - 257
Correction to: Query-to-Communication Lifting for PNP Mika GöösPritish KamathThomas Watson Correction 06 April 2019 Pages: 543 - 544
Prediction from Partial Information and Hindsight, with Application to Circuit Lower Bounds Or MeirAvi Wigderson OriginalPaper 06 April 2019 Pages: 145 - 183
Query-to-Communication Lifting for PNP Mika GöösPritish KamathThomas Watson OriginalPaper 30 November 2018 Pages: 113 - 144
Approximate Nonnegative Rank is Equivalent to the Smooth Rectangle Bound Gillat KolShay MoranAmir Yehudayoff OriginalPaper 20 November 2018 Pages: 1 - 25
Interactive proofs and a Shamir-like result for real number computations Martijn BaartseKlaus Meer OriginalPaper 07 November 2018 Pages: 437 - 469
Lower Bounds and PIT for Non-commutative Arithmetic Circuits with Restricted Parse Trees Guillaume LagardeNutan LimayeSrikanth Srinivasan OriginalPaper 29 September 2018 Pages: 471 - 542
Asymptotic tensor rank of graph tensors: beyond matrix multiplication Matthias ChristandlPéter VranaJeroen Zuiddam OriginalPaper 29 September 2018 Pages: 57 - 111
On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings Benny ApplebaumPavel Raykov OriginalPaper 20 August 2018 Pages: 573 - 616
On semiring complexity of Schur polynomials Sergey FominDima GrigorievÉric Schost OriginalPaper 04 June 2018 Pages: 595 - 616
An adaptivity hierarchy theorem for property testing Clément L. CanonneTom Gur OriginalPaper 24 May 2018 Pages: 671 - 716
Algebraic independence over positive characteristic: New criterion and applications to locally low-algebraic-rank circuits Anurag PandeyNitin SaxenaAmit Sinhababu OriginalPaper 14 May 2018 Pages: 617 - 670
The Landscape of Communication Complexity Classes Mika GöösToniann PitassiThomas Watson OriginalPaper 22 March 2018 Pages: 245 - 304
Tensor surgery and tensor rank Matthias ChristandlJeroen Zuiddam OriginalPaper 22 March 2018 Pages: 27 - 56
Constructive non-commutative rank computation is in deterministic polynomial time Gábor IvanyosYouming QiaoK. V. Subrahmanyam OriginalPaper 22 March 2018 Pages: 561 - 593
The Complexity of Approximating complex-valued Ising and Tutte partition functions Leslie Ann GoldbergHeng Guo OriginalPaper 13 September 2017 Pages: 765 - 833
Communication with Contextual Uncertainty Badih GhaziIlan KomargodskiMadhu Sudan OriginalPaper 29 August 2017 Pages: 463 - 509
Some observations on holographic algorithms Leslie G. Valiant OriginalPaper 29 August 2017 Pages: 351 - 374
On vanishing of Kronecker coefficients Christian IkenmeyerKetan D. MulmuleyMichael Walter OriginalPaper 27 July 2017 Pages: 949 - 992
Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity Irit DinurOr Meir OriginalPaper 27 July 2017 Pages: 375 - 462
Autoreducibility of NP-Complete Sets under Strong Hypotheses John M. HitchcockHadi Shafei OriginalPaper 18 July 2017 Pages: 63 - 97
The Average Sensitivity of Bounded-Depth Formulas Benjamin Rossman OriginalPaper 05 July 2017 Pages: 209 - 223
Tight Size-Degree Bounds for Sums-of-Squares Proofs Massimo LauriaJakob Nordström OriginalPaper 19 April 2017 Pages: 911 - 948
Short lists with short programs in short time Bruno BauwensAnton MakhlinMarius Zimand OriginalPaper 19 April 2017 Pages: 31 - 61
Block-symmetric polynomials correlate with parity better than symmetric Frederic GreenDaniel KreymerEmanuele Viola OriginalPaper 05 April 2017 Pages: 323 - 364
List-Decoding Barnes–Wall Lattices Elena GrigorescuChris Peikert OriginalPaper 12 January 2017 Pages: 365 - 392
Graph Isomorphism, Color Refinement, and Compactness V. ArvindJohannes KöblerOleg Verbitsky OriginalPaper 19 December 2016 Pages: 627 - 685
Low-degree test with polynomially small error Dana Moshkovitz OriginalPaper 19 December 2016 Pages: 531 - 582
On Approximating the Eigenvalues of Stochastic Matrices in Probabilistic Logspace Dean DoronAmir SaridAmnon Ta-Shma OriginalPaper 16 December 2016 Pages: 393 - 420
On the hardness of the noncommutative determinant V. ArvindSrikanth Srinivasan OriginalPaper 30 November 2016 Pages: 1 - 29
