Offers a comprehensive treatment of the theory of algorithms and complexity. Among topics covered are: reductions and NP - completeness, cryptography and protocols, randomized algorithms, and approximability of optimization problems, circuit complexity, the structural aspects of the P=NP question, parallel computation, and more. schovat popis