|
gptkbp:instanceOf
|
theoretical computer science
|
|
gptkbp:contains
|
gptkb:Hamiltonian_cycle_problem
gptkb:Hamiltonian_path_problem
gptkb:Traveling_salesman_problem
gptkb:3-coloring_problem
gptkb:3SAT
gptkb:Exact_cover_by_3-sets
gptkb:Exact_cover_problem
gptkb:Independent_set_problem
gptkb:Integer_programming
gptkb:Knapsack_problem
gptkb:Longest_path_problem
gptkb:Maximum_cut_problem
gptkb:Minimum_cut_problem
gptkb:Monotone_satisfiability
gptkb:Not-All-Equal_3SAT
gptkb:Set_cover_problem
gptkb:Set_splitting_problem
gptkb:Steiner_tree_problem
gptkb:SAT
gptkb:Clique_problem
gptkb:Graph_coloring_problem
gptkb:Subset_sum_problem
gptkb:Traveling_salesman_problem_(decision_version)
gptkb:Vertex_cover_problem
Boolean satisfiability problem
Feedback vertex set
Partition problem
|
|
gptkbp:definedIn
|
languages decidable by a nondeterministic Turing machine in polynomial time
|
|
gptkbp:hasSubgroup
|
recursively enumerable languages
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
NP languages
|
|
gptkbp:relatedTo
|
gptkb:nondeterministic_Turing_machine
gptkb:PSPACE
gptkb:P_vs_NP_problem
gptkb:co-NP
gptkb:NP-hard
gptkb:NP_(nondeterministic_polynomial_time)
polynomial time
NP-complete
deterministic Turing machine
|
|
gptkbp:bfsParent
|
gptkb:nondeterministic_Turing_machine
|
|
gptkbp:bfsLayer
|
5
|