Φορτώνει......
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...
| Κύριος συγγραφέας: | |
|---|---|
| Μορφή: | Printed Book |
| Έκδοση: |
New York :
Cambridge University Press,
2010.
|
| Θέματα: |
Kannur University
| Ταξιθετικός Αριθμός: |
005.1 GOL/P |
|---|---|
| Αντίγραφο Stack | Η τρέχουσα κατάσταση είναι άγνωστη |