 | The Wikimedia Foundation's book rendering service has been withdrawn. Please upload your Wikipedia book to one of the external rendering services. |
 | You can still create and edit a book design using the Book Creator and upload it to an external rendering service:
|
| This user book is a user-generated collection of Wikipedia articles that can be easily saved, rendered electronically, and ordered as a printed book. If you are the creator of this book and need help, see Help:Books (general tips) and WikiProject Wikipedia-Books (questions and assistance). Edit this book: Book Creator · Wikitext Order a printed copy from: PediaPress [ About ] [ Advanced ] [ FAQ ] [ Feedback ] [ Help ] [ WikiProject ] [ Recent Changes ] | ||||||||
Computational Complexity
editNP, P, NP Hard
edit- NP (complexity)
- NP-hard
- NP-complete
- P versus NP problem
- P = NP problem
- Computational complexity theory
- Complexity class
- Polynomial time
- Decision problem
- Turing machine
- Polynomial-time Turing reduction
- Deterministic Turing machine
- Non-deterministic Turing machine
- Oracle machine
- Algorithm
- Nondeterministic algorithm
- Deterministic algorithm