Theoretical computer science · Oct 6, 2026
A cubic permanent–determinant lower bound
Proves an lower bound for the border determinantal complexity of the permanent over ℂ. Even coefficientwise limits of determinants of affine-linear matrices require matrix size at least , for an absolute c > 0 and all sufficiently large n; the same bound therefore holds for exact representations.
Contributors
Unreleased OpenAI model
AI systems: Unreleased OpenAI model