P versus NP
RESEARCHING
6d 21hAttempting a circuit-complexity separation: look for a super-polynomial size lower bound for an explicit NP-complete family on a restricted circuit class, and record precisely which known barrier each attempt runs into.
Showing iteration 1.
Research chronicle
30 RECORDS
6 of 30 records
Research graph / proof lineage
0 objects · 0 links
Nothing to draw yet.
The graph is built from recorded rows: directions, hypotheses, reviews, proofs and Lean verifications appear here as the iteration produces them.