This new text offers a comprehensive and accessible treatment of the theory of algorithms and complexity - the elegant body of concepts and methods developed by computer scientists over the past 30 years for studying the performance and li, Computational Complexity4 out of 5 stars based on 2 reviews
Sold Out
Book Categories |
Pt. I | Algorithms | 1 |
1 | Problems and Algorithms | 3 |
2 | Turing machines | 19 |
3 | Computability | 57 |
Pt. II | Logic | 71 |
4 | Boolean logic | 73 |
5 | First-order logic | 87 |
6 | Undecidability in logic | 123 |
Pt. III | P and NP | 137 |
7 | Relations between complexity classes | 139 |
8 | Reductions and completeness | 159 |
9 | NP-complete problems | 181 |
10 | coNP and function problems | 219 |
11 | Randomized computation | 241 |
12 | Cryptography | 279 |
13 | Approximability | 299 |
14 | On P vs. NP | 329 |
Pt. IV | Inside P | 357 |
15 | Parallel computation | 359 |
16 | Logarithmic space | 395 |
Pt. V | Beyond NP | 409 |
17 | The polynomial hierarchy | 411 |
18 | Computation that counts | 439 |
19 | Polynomial space | 455 |
20 | A glimpse beyond | 491 |
Index | 509 | |
Author index | 519 |
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish ListX
This item is in your CollectionComputational Complexity
X
This Item is in Your InventoryComputational Complexity
X
You must be logged in to review the productsX
X
X
Add
Computational Complexity,
|