Unsolved Problems
Showing 1-3 of 3 problems
OPG-661
Open
P vs. NP
Problem Is P = NP?...
L3
OPG-36892
Open
P vs. PSPACE
Problem Is there a problem that can be computed by a Turing machine in polynomial space and unbounded time but not in polynomial time? More formally, ...
L3
OPG-59968
Open
One-way functions exist
Conjecture One-way functions exist....
L3