Nondeterministic polynomial time
A set of decision problems that can be solved by a Non-Deterministic Turing Machine in a polynomial time. By definition, it means verified in polynomial time.
NP class
Creator
Creator
Seonglae ChoCreated
Created
2023 Nov 30 6:37Editor
Editor
Seonglae ChoEdited
Edited
2023 Dec 19 4:38Refs
Refs
