OpenAI reports a cubic permanent–determinant lower bound
- Theoretical Computer Science
The complex border determinantal complexity of the m×m permanent is Ω(m³), allowing affine-linear determinant representations and coefficientwise limits.
OpenAI reports a cubic permanent–determinant lower bound
- Theoretical Computer Science
The complex border determinantal complexity of the m×m permanent is Ω(m³), allowing affine-linear determinant representations and coefficientwise limits.
Curated contributions 1
Understand the problem ↓Understanding the problem
Read the background
The complex border determinantal complexity of the m×m permanent is Ω(m³), allowing affine-linear determinant representations and coefficientwise limits.
Why it matters
If correct, improves the known asymptotic lower-bound order for exact and border determinantal representations of the permanent.
What counts as progress
Can a cubic lower bound be established for border determinantal complexity?
Website timeline
Publication dates and editorial changes.