Unlock: Unsolved Problems in Computer Science
P vs NP, the matrix multiplication exponent, one-way functions, the unique games conjecture, BPP vs P, natural proofs, and circuit lower bounds. The problems that define the limits of computation.
10 Prerequisites0 Mastered0 Working9 Gaps
Prerequisite mastery10%
Recommended probe
Basic Logic and Proof Techniques is your weakest prerequisite with available questions. You haven't been assessed on this topic yet.
Not assessed18 questions
No quiz
Sign in to track your mastery and see personalized gap analysis.