KRW Composition Theorems via Lifting Susanna F. de RezendeOr MeirRobert Robere OriginalPaper 29 April 2024 Article: 4
Weighted Sum-of-Squares Lower Bounds for Univariate Polynomials Imply \(\text{VP} \neq \text{VNP}\) Pranjal DuttaNitin SaxenaThomas Thierauf OriginalPaper Open access 16 April 2024 Article: 3
On Blocky Ranks Of Matrices Daniel AvrahamAmir Yehudayoff OriginalPaper Open access 06 March 2024 Article: 2
Approximating the chromatic polynomial is as hard as computing it exactly Ferenc BencsJeroen HuijbenGuus Regts OriginalPaper Open access 18 January 2024 Article: 1
Improving \(3N\) Circuit Complexity Lower Bounds Magnus Gausdal Find Alexander Golovnev Alexander S. Kulikov OriginalPaper 16 December 2023 Article: 13
On vanishing sums of roots of unity in polynomial calculus and sum-of-squares Ilario BonacinaNicola GalesiMassimo Lauria OriginalPaper Open access 12 November 2023 Article: 12
A Lower Bound on the Complexity of Testing Grained Distributions Oded Goldreich Dana Ron OriginalPaper 26 October 2023 Article: 11
Parallel algorithms for power circuits and the word problem of the Baumslag group Caroline MattesArmin Weiß OriginalPaper Open access 13 September 2023 Article: 10
On Time-Space Tradeoffs for Bounded-Length Collisions in Merkle-Damgård Hashing Ashrujit GhoshalIlan Komargodski OriginalPaper 13 September 2023 Article: 9
Absolute reconstruction for sums of powers of linear forms: degree 3 and beyond Pascal KoiranSubhayan Saha OriginalPaper 03 August 2023 Article: 8
A Characterization of Functions over the Integers Computable in Polynomial Time Using Discrete Ordinary Differential Equations Olivier BournezArnaud Durand OriginalPaper 12 July 2023 Article: 7
The Power of Natural Properties as Oracles Russell ImpagliazzoValentine KabanetsIlya Volkovich OriginalPaper 06 July 2023 Article: 6
Is it possible to improve Yao’s XOR lemma using reductions that exploit the efficiency of their oracle? Ronen Shaltiel OriginalPaper 23 May 2023 Article: 5
A Complexity Trichotomy for k-Regular Asymmetric Spin Systems Using Number Theory Jin-Yi CaiZhiguo Fu Michael Kowalczyk OriginalPaper 17 May 2023 Article: 4
Schur Polynomials Do Not Have Small Formulas If the Determinant does not Prasad ChauguleMrinal KumarSrikanth Srinivasan OriginalPaper 13 May 2023 Article: 3
Explicit construction of q+1 regular local Ramanujan graphs, for all prime-powers q Rishabh BatraNitin SaxenaDevansh Shringi OriginalPaper 06 April 2023 Article: 2
On sets of linear forms of maximal complexity Michael KaminskiIgor E. ShparlinskiMichel Waldschmidt OriginalPaper Open access 29 November 2022 Article: 1
Quantum versus Randomized Communication Complexity, with Efficient Players Uma GirishRan RazAvishay Tal OriginalPaper 28 October 2022 Article: 17
On Hitting-Set Generators for Polynomials that Vanish Rarely Dean DoronAmnon Ta-ShmaRoei Tell OriginalPaper 22 October 2022 Article: 16
Improved Hitting Set for Orbit of ROABPs Vishwas BhargavaSumanta Ghosh OriginalPaper 12 October 2022 Article: 15
The Complexity of Finding Fair Independent Sets in Cycles Ishay Haviv OriginalPaper 11 October 2022 Article: 14
Quantum generalizations of the polynomial hierarchy with applications to QMA(2) Sevag GharibianMiklos SanthaJustin Yirka OriginalPaper 20 September 2022 Article: 13
A Lower Bound on Determinantal Complexity Mrinal KumarBen Lee Volk OriginalPaper 19 September 2022 Article: 12
Zeros and approximations of Holant polynomials on the complex plane Katrin CaselPhilipp FischbeckJ. A. Gregor Lagodzinski OriginalPaper Open access 27 July 2022 Article: 11
A cost-scaling algorithm for computing the degree of determinants Hiroshi HiraiMotoki Ikeda OriginalPaper Open access 23 July 2022 Article: 10
Disjointness through the Lens of Vapnik–Chervonenkis Dimension: Sparsity and Beyond Anup BhattacharyaSourav ChakrabortyManaswi Paraashar OriginalPaper Open access 05 July 2022 Article: 9
Quadratic Lower Bounds for Algebraic Branching Programs and Formulas Prerona ChatterjeeMrinal KumarBen Lee Volk OriginalPaper 05 July 2022 Article: 8
Improved bounds on the AN-complexity of \(O(1)\)-linear functions Oded Goldreich OriginalPaper 23 June 2022 Article: 7
A quasi-linear irreducibility test in \(\mathbb{K}[[x]][y]\) Adrien PoteauxMartin Weimann OriginalPaper 11 June 2022 Article: 6
Computing zero-dimensional tropical varieties via projections Paul Görlach Yue RenLeon Zhang OriginalPaper Open access 20 May 2022 Article: 5
Expander-Based Cryptography Meets Natural Proofs Igor C. OliveiraRahul SanthanamRoei Tell OriginalPaper 16 March 2022 Article: 4
The complexity of approximating the complex-valued Potts model Andreas GalanisLeslie Ann GoldbergAndrés Herrera-Poyatos OriginalPaper Open access 03 February 2022 Article: 2
Rank and border rank of Kronecker powers of tensors and Strassen's laser method Austin ConnerFulvio GesmundoEmanuele Ventura OriginalPaper Open access 18 December 2021 Article: 1
Correction to: Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs Dmitry ItsyksonArtur RiazanovPetr Smirnov Correction 17 November 2021 Article: 16
Factorization of Polynomials Given by Arithmetic Branching Programs Amit Sinhababu Thomas Thierauf OriginalPaper Open access 15 October 2021 Article: 15
Lower Bounds for Arithmetic Circuits via the Hankel Matrix Nathanaël FijalkowGuillaume LagardeOlivier Serre OriginalPaper 08 October 2021 Article: 14
Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs Dmitry ItsyksonArtur RiazanovPetr Smirnov OriginalPaper 27 August 2021 Article: 13
An Exponential Separation Between MA and AM Proofs of Proximity Tom GurYang P. LiuRon D. Rothblum OriginalPaper Open access 18 August 2021 Article: 12
Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity Toniann PitassiMorgan ShirleyThomas Watson OriginalPaper 02 July 2021 Article: 10
Blackbox identity testing for sum of special ROABPs and its border class Pranav BishtNitin Saxena OriginalPaper 10 June 2021 Article: 8
Reversible Pebble Games and the Relation Between Tree-Like and General Resolution Space Jacobo ToránFlorian Wörz OriginalPaper Open access 01 May 2021 Article: 7
Lower Bounds for Matrix Factorization Ben Lee VolkMrinal Kumar OriginalPaper 02 April 2021 Article: 6
Subquadratic-Time Algorithms for Normal Bases Mark GiesbrechtArmin JamshidpeyÉric Schost OriginalPaper 02 March 2021 Article: 5
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling Susanna F. De RezendeOr MeirRobert Robere OriginalPaper 12 February 2021 Article: 4
Explicit List-Decodable Codes with Optimal Rate for Computationally Bounded Channels Ronen ShaltielJad Silbak OriginalPaper 20 January 2021 Article: 3
Resolution with Counting: Dag-Like Lower Bounds and Different Moduli Fedor Part Iddo Tzameret OriginalPaper 08 January 2021 Article: 2
