| 7 | -- | 0 | Oded Goldreich 0001. Improved bounds on the AN-complexity of O(1)-linear functions |
| 8 | -- | 0 | Prerona Chatterjee, Mrinal Kumar 0001, Adrian She, Ben lee Volk. Quadratic Lower Bounds for Algebraic Branching Programs and Formulas |
| 9 | -- | 0 | Anup Bhattacharya, Sourav Chakraborty 0001, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar. Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond |
| 10 | -- | 0 | Hiroshi Hirai 0001, Motoki Ikeda. A cost-scaling algorithm for computing the degree of determinants |
| 11 | -- | 0 | Katrin Casel, Philipp Fischbeck, Tobias Friedrich 0001, Andreas Göbel 0001, J. A. Gregor Lagodzinski. Zeros and approximations of Holant polynomials on the complex plane |
| 12 | -- | 0 | Mrinal Kumar 0001, Ben lee Volk. A Lower Bound on Determinantal Complexity |
| 13 | -- | 0 | Sevag Gharibian, Miklos Santha, Jamie Sikora, Aarthi Sundaram, Justin Yirka. Quantum generalizations of the polynomial hierarchy with applications to QMA(2) |
| 14 | -- | 0 | Ishay Haviv. The Complexity of Finding Fair Independent Sets in Cycles |
| 15 | -- | 0 | Vishwas Bhargava, Sumanta Ghosh. Improved Hitting Set for Orbit of ROABPs |
| 16 | -- | 0 | Dean Doron, Amnon Ta-Shma, Roei Tell. On Hitting-Set Generators for Polynomials that Vanish Rarely |
| 17 | -- | 0 | Uma Girish, Ran Raz, Avishay Tal. Quantum versus Randomized Communication Complexity, with Efficient Players |