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