Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



LATEST > REPORTS:
RSS-Feedprevious PreviousNext next

TR26-289 | 27th October 2026
Mark Bun, Mandar Juvekar

UPP$^{\text{cc}}$ is Not Closed Under Intersection

The sign rank of a ${\pm 1}$-valued matrix $A$ is the minimum rank of a real matrix that agrees with $A$ entrywise in sign. For every sufficiently large $d$, we give an explicit matrix $A$ with $2^{\Theta(d^2)}$ rows and columns and sign rank $\Theta(d)$ such that $A \land A$ has ... more >>>


TR26-288 | 30th October 2026
Nathan Acheampong, Ben Davis, Robert Robere

Polynomial Interpolation for Sherali-Adams Lower Bounds

We resolve two open problems regarding the Sherali-Adams proof system. First, we show that Res(2), which manipulates 2-DNF formulas, is exponentially stronger than Sherali-Adams. This provides a sharp separation in power between Sherali-Adams and the bounded-depth Frege hierarchy, as Sherali-Adams polynomially simulates Resolution. Second, we prove that Sherali-Adams is not ... 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 >>>



previous PreviousNext next


ISSN 1433-8092 | Imprint