Home›Open Questions›Is every efficiently checkable problem also efficiently solvable, or is checking genuinely easier than solving?Open QuestionsIs every efficiently checkable problem also efficiently solvable, or is checking genuinely easier than solving?Citation FormatsGeneral ReferenceGeneral Reference Citation TextMathematics Atlas. "Is every efficiently checkable problem also efficiently solvable, or is checking genuinely easier than solving?." Accessed August 30, 2026. https://dev-mathematics.interactiveatlas.org/open-questions-index/p-versus-np-open-question.Copy General ReferenceAPA StyleAPA Style Citation TextMathematics Atlas. (n.d.). Is every efficiently checkable problem also efficiently solvable, or is checking genuinely easier than solving?. Retrieved August 30, 2026, from https://dev-mathematics.interactiveatlas.org/open-questions-index/p-versus-np-open-questionCopy APA StyleBibTeXBibTeX Citation Text@misc{mathematicsatlas-is-every-efficiently-checkable-problem-a, author = {Mathematics Atlas}, title = {Is every efficiently checkable problem also efficiently solvable, or is checking genuinely easier than solving?}, year = {2026}, url = {https://dev-mathematics.interactiveatlas.org/open-questions-index/p-versus-np-open-question}, note = {Accessed August 30, 2026} }Copy BibTeXOpen QuestionCross-Tradition ConnectionsSourcesComments (0)Reader Challenges (0 open reader challenges)Open QuestionFifty years of concerted effort by theoretical computer scientists has produced neither a proof that P equals NP nor a proof that it does not; most researchers believe P does not equal NP but this remains an unproven belief, not a result.What would resolve this A proof either that some NP problem provably cannot be solved in polynomial time (P does not equal NP), or a genuine polynomial-time algorithm for an NP-complete problem (P equals NP); a Clay Mathematics Institute Millennium Prize of one million dollars is offered for a correct resolution either way.OpenComputational complexity theoryClay Mathematics InstituteCross-Tradition ConnectionsQuestion OnP versus NP, Conjectures Well-attested Source Clay Mathematics Institutetier 1SourcesClay Mathematics Institutetier 1Clay Mathematics InstituteView the SourceComments (0)No comments yet. Be the first to share a thought.Sign in to join the discussion.Reader Challenges (0 open reader challenges)No disputes yet. Spotted an error or a better source? Open the first one.Sign in to dispute this or suggest a correction.View At A Past YearThe atlas records no dated fact of its own for this entry, so there is no other year to choose.Show This Year