theoretical-computer-science
P versus NP
Determine whether every problem whose solution can be verified in polynomial time can also be solved in polynomial time.
100Significance / 100
0Frontier 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
Recorded attempts
Evidence graph
Connected research record
No public relationships recorded yet.