লোডিং...
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 |
| ভাষা: | English |
| প্রকাশিত: |
New York :
Cambridge University Press,
2010.
|
| বিষয়গুলি: | |
| অনলাইন ব্যবহার করুন: | Cover image |
