Statements (56)
| Predicate | Object |
|---|---|
| gptkbp:instance_of |
gptkb:chess_match
|
| gptkbp:bfsLayer |
5
|
| gptkbp:bfsParent |
gptkb:Cook's_theorem
|
| gptkbp:affects |
gptkb:software_framework
|
| gptkbp:conservation_status |
over 50 years
|
| gptkbp:example |
the traveling salesman problem
|
| gptkbp:first_appearance |
gptkb:1971
|
| gptkbp:has_impact_on |
gptkb:Artificial_Intelligence
gptkb:currency algorithm design |
| gptkbp:has_influence_on |
data security
|
| https://www.w3.org/2000/01/rdf-schema#label |
P vs NP
|
| gptkbp:is_a_framework_for |
gptkb:Mathematician
|
| gptkbp:is_associated_with |
algorithm efficiency
|
| gptkbp:is_considered |
NP problems can be solved in polynomial time
P equals NP |
| gptkbp:is_critical_for |
theoretical computer science
|
| gptkbp:is_discussed_in |
gptkb:quantum_computing
gptkb:NP-completeness |
| gptkbp:is_influenced_by |
gptkb:physicist
gptkb:political_movement gptkb:software_framework gptkb:Cloud_Computing_Service gptkb:battle gptkb:technology computer vision financial modeling natural language processing network security operations research resource allocation scheduling problems bioinformatics data mining distributed systems network design optimization problems complex systems information retrieval social network analysis cryptographic protocols database theory computational biology algorithmic game theory |
| gptkbp:is_often_associated_with |
Can every problem whose solution can be quickly verified be quickly solved?
|
| gptkbp:is_part_of |
gptkb:Millennium_Prize_Problems
|
| gptkbp:is_related_to |
complexity theory
|
| gptkbp:led_to |
the development of new algorithms
|
| gptkbp:number_of_issues |
gptkb:computer_science
|
| gptkbp:proposed_by |
gptkb:Stephen_Cook
|
| gptkbp:related_concept |
problems solvable in polynomial time
problems verifiable in polynomial time |
| gptkbp:subject |
gptkb:philosopher
computational complexity theory numerous research papers computer scientists |