Á lódáil...
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...
| Príomhúdar: | |
|---|---|
| Formáid: | Printed Book |
| Foilsithe: |
New York :
Cambridge University Press,
2010.
|
| Ábhair: |
Kannur University
| Gairmuimhir: |
005.1 GOL/P |
|---|---|
| Cóip Stack | Live Status Unavailable |