NP (nondeterministic polynomial time)

GPTKB entity

Predicate	Object
gptkbp:instanceOf	theoretical computer science
gptkbp:characterizedBy	problems verifiable in polynomial time by a deterministic Turing machine problems solvable in polynomial time by a nondeterministic Turing machine
gptkbp:contains	gptkb:NP-hard_problems gptkb:P_(polynomial_time) NP-complete problems
gptkbp:definedIn	theoretical computer science
gptkbp:example	gptkb:Hamiltonian_path_problem gptkb:Clique_problem gptkb:Subset_sum_problem gptkb:Vertex_cover_problem gptkb:Boolean_satisfiability_problem_(SAT)
gptkbp:hasProperty	closed under concatenation closed under Kleene star closed under intersection closed under reversal closed under union not closed under complement (unless NP = co-NP)
gptkbp:hasSubgroup	gptkb:PSPACE gptkb:P_(polynomial_time)
https://www.w3.org/2000/01/rdf-schema#label	NP (nondeterministic polynomial time)
gptkbp:introduced	gptkb:Stephen_Cook
gptkbp:introducedIn	1971
gptkbp:numberOfIssues	gptkb:P_vs_NP NP vs co-NP NP-completeness of various problems
gptkbp:openQuestion	Is P equal to NP?
gptkbp:relatedTo	gptkb:P_vs_NP_problem gptkb:co-NP gptkb:NP-hard NP-complete
gptkbp:standsFor	nondeterministic polynomial time
gptkbp:symbol	NP
gptkbp:bfsParent	gptkb:interactive_proof_systems
gptkbp:bfsLayer	5