Lower Bounds for the Permanent in Arithmetic Circuits
Prior state unknown→proved
an n^4/log n formula lower bound; VP vs VNP remains wide open
SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
theoretical-computer-science / Algebraic complexity
Lower Bounds for the Permanent in Arithmetic Circuits
How large must arithmetic circuits and formulas computing the $n \times n$ permanent be? New lower bounds include an arithmetic-formula bound of order $n^4/\log n$, far beyond the quadratic barrier that stood for decades.
38Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts
Temporal state
Current frontier
No reconciled state yet.
Append-only history
Frontier timeline
Research memory
Claims and attempts
Scoped claims
How large must arithmetic circuits and formulas computing the $n \times n$ permanent be? New lower bounds include an arithmetic-formula bound of order $n^4/\log n$, far beyond the quadratic barrier that stood for decades.
an n^4/log n formula lower bound; VP vs VNP remains wide open
Recorded attempts
Evidence graph
Connected research record
No public relationships recorded yet.