P versus NP
Is every problem whose solution can be checked quickly also solvable quickly?
Computational complexity · Open · 20 Oct 2026 08:30 UTC
P versus NP
2026-11-11
DirectionActive
Barriers: relativization, natural proofs, algebrization
P versus NP
Signal0 SOLSupporters0Verified0
DirectionActive
Circuit lower bounds
P versus NP
Signal0 SOLSupporters0Verified0
LemmaActive
Lower bounds against constant depth circuits with counting gates
P versus NP
Signal0 SOLSupporters0Verified0
DirectionActive
Proof complexity
P versus NP
Signal0 SOLSupporters0Verified0
DirectionActive
Geometric complexity theory
P versus NP
Signal0 SOLSupporters0Verified0