- 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.
- Clément Canonne 0002. A short note on (distribution) testing lower bounds via polynomials. Electronic Colloquium on Computational Complexity (ECCC), TR26, 2026.
- Yaroslav Alekseev, Nikita Gaevoy. New Polynomial-Depth Res(+) Lower Bounds. Electronic Colloquium on Computational Complexity (ECCC), TR26, 2026.
- Amik Raj Behera, Magnus Rahbek Dalgaard Hansen, Nutan Limaye, Srikanth Srinivasan 0001. Separation Results for Constant-Depth and Multilinear Ideal Proof Systems. Electronic Colloquium on Computational Complexity (ECCC), TR26, 2026.
- Matt Kovacs-Deak, Daochen Wang, Rain Zimin Yang. Rational degree is polynomially related to degree. Electronic Colloquium on Computational Complexity (ECCC), TR26, 2026.
- Ran Raz. A Note on Natural-Proofs for Super-Linear Lower Bounds for Linear Functions. Electronic Colloquium on Computational Complexity (ECCC), TR26, 2026.
- Swastik Kopparty. Recovering polynomials over finite fields from noisy character values. Electronic Colloquium on Computational Complexity (ECCC), TR26, 2026.
- Lijie Chen, Yichuan Wang. Separating RAM and Multitape Turing Machines with Short Random Oracles. Electronic Colloquium on Computational Complexity (ECCC), TR26, 2026.
- Ilya Volkovich. Yet Another Proof that $BPP \subseteq PH$. Electronic Colloquium on Computational Complexity (ECCC), TR26, 2026.
- Antoine Vinciguerra. Linear Matroid Intersection is in Catalytic Logspace. Electronic Colloquium on Computational Complexity (ECCC), TR25, 2025.