Загрузка...
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 | Недоступно состояние Live" What does mean the status Live (working) |