1. Correction to: Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs

   • Dmitry Itsykson
   • Artur Riazanov
   • Petr Smirnov

   Correction 17 November 2021 Article: 16

2. Factorization of Polynomials Given by Arithmetic Branching Programs

   • Amit Sinhababu
   • Thomas Thierauf

   OriginalPaper Open access 15 October 2021 Article: 15

3. Lower Bounds for Arithmetic Circuits via the Hankel Matrix

   • Nathanaël Fijalkow
   • Guillaume Lagarde
   • Olivier Serre

   OriginalPaper 08 October 2021 Article: 14

4. Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs

   • Dmitry Itsykson
   • Artur Riazanov
   • Petr Smirnov

   OriginalPaper 27 August 2021 Article: 13

5. An Exponential Separation Between MA and AM Proofs of Proximity

   • Tom Gur
   • Yang P. Liu
   • Ron D. Rothblum

   OriginalPaper Open access 18 August 2021 Article: 12

6. The hardest halfspace

   • Alexander A. Sherstov

   OriginalPaper Open access 03 August 2021 Article: 11

7. Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity

   • Toniann Pitassi
   • Morgan Shirley
   • Thomas Watson

   OriginalPaper 02 July 2021 Article: 10