Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > VALIANT'S COMPLEXITY CLASSES:
Reports tagged with Valiant's Complexity Classes:
TR26-207 | 23rd September 2026
Marco Carmosino, Nikhil Gupta, Ilya Volkovich

Towards an Interesting VPSPACE-complete Problem

We introduce a variant of a polynomial family called $\TQBFfamily$ obtained from `arithmetization' of the popular $\PSPACE$-complete problem - $\TQBF$. This polynomial family has several nice characteristics such as: $\TQBFfamily \in \VPSPACE_b$, where $\VPSPACEb$ is the `bounded' algebraic version of $\PSPACE$, it is \emph{self-testable}, it captures the computational power of ... more >>>


TR26-287 | 29th October 2026
Karthik Sheshadri

Extending OpenAI's cubic lower bound for the permanent to odd characteristic, Pfaffian representations, and polynomial entries

OpenAI's Sep 2026 preprint introduced the first cubic lower bound on the border DC of the permanent. Their preprint generalizes the method I introduced in my June 2026 preprint (https://arxiv.org/abs/2606.15970; see also TR26-275). However, their proof only applies over $\mathbb{C}$.

In this note, I prove that the cubic lower bound ... more >>>




ISSN 1433-8092 | Imprint