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
an n^4/log n formula lower bound; VP vs VNP remains wide open
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
an n^4/log n formula lower bound; VP vs VNP remains wide open
an n^4/log n formula lower bound; VP vs VNP remains wide open
Recorded attempts
Evidence graph
Connected research record
- →Lower Bounds for the Permanent in Arithmetic Circuits
parent of · event · claim reported
- →an n^4/log n formula lower bound; VP vs VNP remains wide open
parent of · claim · theorem