- Aminadav Chuyoon, Amir Shpilka. On Factorization of Sparse Polynomials of Bounded Individual Degree. Electronic Colloquium on Computational Complexity (ECCC), TR26, 2026.
- Robert Andrews 0003, Abhibhav Garg, Éric Schost. Hilbert's Nullstellensatz is in the Counting Hierarchy. Electronic Colloquium on Computational Complexity (ECCC), TR26, 2026.
- Noga Ron-Zewi, Mor Weiss. A Note on the Equivalence Between Zero-knowledge and Quantum CSS Codes. Electronic Colloquium on Computational Complexity (ECCC), TR26, 2026.
- Cornelius Brand, Radu Curticapean, Petteri Kaski, Baitian Li, Ian Orzel, Tim Seppelt, Jiaheng Wang 0002. Beyond Bilinear Complexity: What Works and What Breaks with Many Modes?. Electronic Colloquium on Computational Complexity (ECCC), TR26, 2026.
- Théo Borém Fabris, Nutan Limaye, Srikanth Srinivasan 0001, Amir Yehudayoff. Multilinear Algebraic Branching Programs and the Min-Partition Rank Method. Electronic Colloquium on Computational Complexity (ECCC), TR26, 2026.
- Sreejata Kishor Bhattacharya, Farzan Byramji, Arkadev Chattopadhyay, Yogesh Dahiya, Shachar Lovett. Quantum-Classical Equivalence for AND-Functions. Electronic Colloquium on Computational Complexity (ECCC), TR26, 2026.
- Yipin Wang. 0 Lower Bound for Generalized Parity. Electronic Colloquium on Computational Complexity (ECCC), TR26, 2026.
- Clément Canonne 0002. A short note on (distribution) testing lower bounds via polynomials. Electronic Colloquium on Computational Complexity (ECCC), TR26, 2026.
- Gil Cohen, Dean Doron, Noam Goldgraber. Optimal PRGs for Low-Degree Polynomials over Polynomial-Size Fields. Electronic Colloquium on Computational Complexity (ECCC), TR26, 2026.
- Alon Dermer, Ronen Shaltiel. Multiplicative Pseudorandom Generators for Nondeterministic Circuits. Electronic Colloquium on Computational Complexity (ECCC), TR26, 2026.