This article is a list of unsolved problems in computer science. A problem in computer science is considered unsolved when no solution is known, or when experts in the field disagree about how to solve computer problems pdf solutions. What is the relationship between BQP and NP?
Is the exponential time hypothesis true? Can clustered planar drawings be found in polynomial time? Can the discrete logarithm be computed in polynomial time? Can the graph isomorphism problem be solved in polynomial time?
Can parity games be solved in polynomial time? Can the rotation distance between two binary trees be computed in polynomial time?