1. Quantum versus Randomized Communication Complexity, with Efficient Players

   • Uma Girish
   • Ran Raz
   • Avishay Tal

   OriginalPaper 28 October 2022 Article: 17

2. On Hitting-Set Generators for Polynomials that Vanish Rarely

   • Dean Doron
   • Amnon Ta-Shma
   • Roei Tell

   OriginalPaper 22 October 2022 Article: 16

3. Improved Hitting Set for Orbit of ROABPs

   • Vishwas Bhargava
   • Sumanta Ghosh

   OriginalPaper 12 October 2022 Article: 15

4. The Complexity of Finding Fair Independent Sets in Cycles

   • Ishay Haviv

   OriginalPaper 11 October 2022 Article: 14

5. Quantum generalizations of the polynomial hierarchy with applications to QMA(2)

   • Sevag Gharibian
   • Miklos Santha
   • Justin Yirka

   OriginalPaper 20 September 2022 Article: 13

6. A Lower Bound on Determinantal Complexity

   • Mrinal Kumar
   • Ben Lee Volk

   OriginalPaper 19 September 2022 Article: 12

7. Zeros and approximations of Holant polynomials on the complex plane

   • Katrin Casel
   • Philipp Fischbeck
   • J. A. Gregor Lagodzinski

   OriginalPaper Open access 27 July 2022 Article: 11

8. A cost-scaling algorithm for computing the degree of determinants

   • Hiroshi Hirai
   • Motoki Ikeda

   OriginalPaper Open access 23 July 2022 Article: 10

9. Disjointness through the Lens of Vapnik–Chervonenkis Dimension: Sparsity and Beyond

   • Anup Bhattacharya
   • Sourav Chakraborty
   • Manaswi Paraashar

   OriginalPaper Open access 05 July 2022 Article: 9

10. Quadratic Lower Bounds for Algebraic Branching Programs and Formulas

    • Prerona Chatterjee
    • Mrinal Kumar
    • Ben Lee Volk

    OriginalPaper 05 July 2022 Article: 8

11. Improved bounds on the AN-complexity of \(O(1)\)-linear functions

    • Oded Goldreich

    OriginalPaper 23 June 2022 Article: 7