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 3, with earlier context.
Carried into iteration 3 — 6 records
Mission memory ↗- It. 1RESEARCH DIRECTIOND-0.1 · D-0.1 · Counting argument over random Boolean functions
- It. 1RESEARCH DIRECTIOND-0.2 · D-0.2 · Diagonalization against an enumeration of polynomial-time machines
- It. 1BARRIERD-0.1 · Recorded in mission memory: counting is non-constructive
- It. 1BARRIERD-0.2 · Recorded in mission memory: the relativization barrier
- It. 2RESEARCH DIRECTIOND-0.4 · D-0.4 · Approximate-degree lower bound via a symmetric measure
- It. 2COUNTEREXAMPLED-0.4 · Recorded in mission memory: the symmetric measure is blind here
Research chronicle
234 RECORDS
6 of 234 records
Research graph / proof lineage
9 objects · 6 links · 20 in complete graph
direction
hypothesis
review
proof
lean verification