|
gptkbp:instance_of
|
gptkb:Mathematics
|
|
gptkbp:can_be_stated_as
|
whether every problem whose solution can be verified quickly can also be solved quickly
|
|
gptkbp:challenges
|
theoretical computer scientists
|
|
gptkbp:depicts
|
the limits of algorithm design
|
|
gptkbp:first_introduced
|
gptkb:1971
|
|
gptkbp:has_a_focus_on
|
computational complexity research
|
|
gptkbp:has_implications_for
|
gptkb:crypt
gptkb:Artificial_Intelligence
optimization problems
|
|
gptkbp:has_not_been_proven
|
true or false
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
P = NP problem
|
|
gptkbp:illustrated_by
|
the traveling salesman problem
|
|
gptkbp:is_a_central_question_in
|
algorithm theory
|
|
gptkbp:is_a_foundation_for
|
theory of computation
|
|
gptkbp:is_a_fundamental_question_in
|
theoretical computer science
|
|
gptkbp:is_a_major_open_problem_in
|
gptkb:computer_science
|
|
gptkbp:is_a_problem_that_has
|
real-world implications
|
|
gptkbp:is_a_question_about
|
the limits of computation
|
|
gptkbp:is_a_question_of
|
algorithmic solvability
|
|
gptkbp:is_a_question_that_affects
|
gptkb:Software_Development
|
|
gptkbp:is_a_question_that_has
|
not been resolved
|
|
gptkbp:is_a_subject_of
|
gptkb:Mathematics
numerous research papers
public interest
conferences and workshops
computer scientists
philosophical inquiry
|
|
gptkbp:is_associated_with
|
polynomial time
the concept of NP-completeness
|
|
gptkbp:is_cited_in
|
academic literature
|
|
gptkbp:is_considered
|
one of the most important questions in theoretical computer science
|
|
gptkbp:is_considered_as
|
the most important open problem in mathematics
|
|
gptkbp:is_explored_in
|
mathematical proofs
|
|
gptkbp:is_linked_to
|
nondeterministic polynomial time
|
|
gptkbp:is_often_compared_to
|
other mathematical problems
|
|
gptkbp:is_often_described_as
|
gptkb:P_vs_NP
|
|
gptkbp:is_often_discussed_in
|
algorithm efficiency
computational feasibility
|
|
gptkbp:is_often_referenced_in
|
computer science education
|
|
gptkbp:is_part_of
|
gptkb:Millennium_Prize_Problems
|
|
gptkbp:is_related_to
|
decision problems
|
|
gptkbp:is_studied_in
|
decades
|
|
gptkbp:issues
|
the relationship between P and NP classes
|
|
gptkbp:proposed_by
|
gptkb:Stephen_Cook
|
|
gptkbp:related_to
|
complexity theory
|
|
gptkbp:topics
|
complexity classes
|
|
gptkbp:bfsParent
|
gptkb:Cook's_theorem
|
|
gptkbp:bfsLayer
|
6
|