Loading...
P, NP, and NP-completeness :The basics of computational complexity
"The focus of this book is the P-versus-NP Question and the theory of NP-completeness. It also provides adequate preliminaries regarding computational problems and computational models. The P-versus-NP Question asks whether or not finding solutions is harder than checking the correctness of sol...
| Hovedforfatter: | |
|---|---|
| Format: | Printed Book |
| Udgivet: |
New York :
Cambridge University Press,
2010.
|
| Fag: |
Search Result 1
Search Result 2
Search Result 3