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
