Journal: Computational Complexity

Volume 32, Issue 2

6 -- 0Russell Impagliazzo, Valentine Kabanets, Ilya Volkovich. The Power of Natural Properties as Oracles
7 -- 0Olivier Bournez, Arnaud Durand 0001. A Characterization of Functions over the Integers Computable in Polynomial Time Using Discrete Ordinary Differential Equations
8 -- 0Pascal Koiran, Subhayan Saha. Absolute reconstruction for sums of powers of linear forms: degree 3 and beyond
9 -- 0Ashrujit Ghoshal, Ilan Komargodski. On Time-Space Tradeoffs for Bounded-Length Collisions in Merkle-Damgård Hashing
10 -- 0Caroline Mattes, Armin Weiß. Parallel algorithms for power circuits and the word problem of the Baumslag group
11 -- 0Oded Goldreich 0001, Dana Ron. A Lower Bound on the Complexity of Testing Grained Distributions
12 -- 0Ilario Bonacina, Nicola Galesi, Massimo Lauria. On vanishing sums of roots of unity in polynomial calculus and sum-of-squares
13 -- 0Magnus Gausdal Find, Alexander Golovnev, Edward A. Hirsch, Alexander S. Kulikov. Improving 3N Circuit Complexity Lower Bounds

Volume 32, Issue 1

1 -- 0Michael Kaminski, Igor E. Shparlinski, Michel Waldschmidt. On sets of linear forms of maximal complexity
2 -- 0Rishabh Batra, Nitin Saxena 0001, Devansh Shringi. Explicit construction of q+1 regular local Ramanujan graphs, for all prime-powers q
3 -- 0Prasad Chaugule, Mrinal Kumar 0001, Nutan Limaye, Chandra Kanta Mohapatra, Adrian She, Srikanth Srinivasan 0001. Schur Polynomials Do Not Have Small Formulas If the Determinant does not
5 -- 0Ronen Shaltiel. Is it possible to improve Yao's XOR lemma using reductions that exploit the efficiency of their oracle?