Warehouse Stock Clearance Sale

Grab a bargain today!


Computational Complexity
By
Rating

Product Description
Product Details

Table of Contents

I. ALGORITHMS.

 1. Problems and Algorithms.
 2. Turing Machines.
 3. Undecidability.

II. LOGIC.

 1. Boolean Logic.
 2. First Order Logic.
 3. Undecidability in Logic.

III. P AND NP.

 1. Relations between Complexity Classes.
 2. Reductions and Completeness.
 3. NP-Complete Problems.
 4. coNP and Function Problems.
 5. Randomized Computation.
 6. Cryptography.
 7. Approximability.
 8. On P vs. NP.

IV. INSIDE P.

 1. Parallel Computation.
 2. Logarithmic Space.

V. BEYOND NP.

 1. The Polynomial Hierarchy.
 2. Computation That Counts.
 3. Polynomial Space.
 4. A Glimpse Beyond. 0201530821T04062001

Ask a Question About this Product More...
 
Look for similar items by category
Home » Books » Computers » General
Home » Books » Computers » Programming » General
Home » Books » Science » Mathematics » Logic
People also searched for
This title is unavailable for purchase as none of our regular suppliers have stock available. If you are the publisher, author or distributor for this item, please visit this link.

↑
Back to top