The world's unsolved problems
993 open questions across 14 fields, gathered from Wikipedia. Pick one and start thinking.
52 results in Computer science · clear · surprise me
-
P versus NP problem
The P vs NP problem is a major unsolved question in computer science that asks whether every problem whose solution can be quickly verified by a computer (NP) can also be quickly solved by a computer (P). This question has profound implications for fields...
Read on Wikipedia → -
What is the relationship between BQP and NP?
Read on Wikipedia → -
NC = P problem
Read on Wikipedia → -
NP = co-NP problem
Read on Wikipedia → -
P = BPP problem
Read on Wikipedia → -
P = PSPACE problem
Read on Wikipedia → -
L = NL problem
Read on Wikipedia → -
PH = PSPACE problem
Read on Wikipedia → -
L = P problem
Read on Wikipedia → -
L = RL problem
Read on Wikipedia → -
Unique games conjecture
Read on Wikipedia → -
Is the exponential time hypothesis true?
Read on Wikipedia → -
Do one-way functions exist?
Read on Wikipedia → -
Log-rank conjecture
Read on Wikipedia → -
Hartmanis–Stearns conjecture
Read on Wikipedia → -
Can integer factorization be done in polynomial time on a classical (non-quantum) computer?
Read on Wikipedia → -
Can the discrete logarithm be computed in polynomial time on a classical (non-quantum) computer?
Read on Wikipedia → -
Can the shortest vector of a lattice be computed in polynomial time on a classical or quantum computer?
Read on Wikipedia → -
Can the graph isomorphism problem be solved in polynomial time on a classical computer?
Read on Wikipedia → -
Is graph canonization polynomial-time equivalent to the graph isomorphism problem?
Read on Wikipedia → -
Can leaf powers and k-leaf powers be recognized in polynomial time?
Read on Wikipedia → -
Can parity games be solved in polynomial time?
Read on Wikipedia → -
Can graphs of bounded clique-width be recognized in polynomial time?
Read on Wikipedia → -
Can one find a simple closed quasigeodesic on a convex polyhedron in polynomial time?
Read on Wikipedia → -
Can a simultaneous embedding with fixed edges for two given graphs be found in polynomial time?
Read on Wikipedia → -
Can the square-root sum problem be solved in polynomial time in the Turing machine model?
Read on Wikipedia → -
Skolem problem
Is it decidable whether an algebraic linear recurrence sequence has a zero?
Read on Wikipedia → -
Hilbert's tenth problem over the field of rational numbers
Read on Wikipedia → -
The dynamic optimality conjecture
Do splay trees have a bounded competitive ratio?
Read on Wikipedia → -
Can a depth-first search tree be constructed in NC?
Read on Wikipedia →
Data last refreshed 2026-10-20 03:01 UTC.