|
gptkb:Unique_Games_problem
|
polynomial-time solvability
|
|
gptkb:Perfect_Number_Problem
|
Infinitude of perfect numbers
|
|
gptkb:NP_(nondeterministic_polynomial_time)
|
Is P equal to NP?
|
|
gptkb:EXPTIME
|
gptkb:P_vs_EXPTIME
|
|
gptkb:Perfect_Number_Problem
|
Existence of odd perfect numbers
|
|
gptkb:NP_(complexity_class)
|
Is P equal to NP?
|
|
gptkb:PSPACE_(complexity_class)
|
Is NP = PSPACE?
|
|
gptkb:BPP_(complexity_class)
|
Is BPP = P?
|
|
gptkb:Unique_Games_problem
|
Unique Games Conjecture validity
|
|
gptkb:BPP_(complexity_class)
|
Is BPP = NP?
|
|
gptkb:Riesel_problem
|
Are there smaller Riesel numbers than 509203?
|
|
gptkb:BPP_(complexity_class)
|
Is P = BPP?
|
|
gptkb:NEXPTIME
|
whether NEXPTIME = PSPACE
|
|
gptkb:EXPTIME
|
EXPTIME vs NEXPTIME
|
|
gptkb:proton_mass_puzzle
|
how most of the proton mass arises from QCD dynamics rather than quark masses
|
|
gptkb:PSPACE_vs_EXPTIME
|
Is PSPACE = EXPTIME?
|
|
gptkb:PSPACE
|
gptkb:P_vs_PSPACE
|
|
gptkb:Suslin_lines
|
Existence is independent of ZFC
|
|
gptkb:continuum_(set_theory)
|
gptkb:continuum_hypothesis
|
|
gptkb:PSPACE
|
gptkb:PSPACE_vs_EXPTIME
|