เอ็นพีบริบูรณ์
Sign in to saveAlso known as NPC, nondeterministic polynomial time-complete, nondeterministic polynomial time-complete class, CNP
thumb|upright=0.8|It can be difficult to find a valid solution to a Sudoku puzzle, but once a solution has been found its validity can be verified easily. It is NP-complete to determine whether an Sudoku has a valid solution.
Wikidata facts
- Instance of
- complexity class
- Subclass of
- computational problem
- Part of
- NP
- Has part
- strong NP-completeness
- Image
- P np np-complete np-hard.svg
Show 5 more facts
- topic's main category
- Category:NP-complete problems
- facet of
- P versus NP problem
- Stack Exchange tag
- stackoverflow.com/tags/np-complete
- maintained by WikiProject
- WikiProject Mathematics
- Commons category
- NP-complete problems
Sources (3)
via Wikidata · CC0