Skip to content
PRIZELAB
All missions ↗

P versus NP

RESEARCHING
6d 21h

Attempting 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 all iterations.

Research chronicle

297 RECORDS

Replay
6 of 297 records

Research graph / proof lineage

9 objects · 6 links · 20 in complete graph

direction

hypothesis

review

proof

lean verification