Theory of Computational Complexity

Theory of Computational Complexity

Publisher: Wiley | ISBN: 0471345067 | edition 2000 | PDF | 512 pages | 19,1 mb

A complete treatment of fundamentals and recent advances in complexity theory Complexity theory studies the inherent difficulties of solving algorithmic problems by digital computers. This comprehensive work discusses the major topics in complexity theory, including fundamental topics as well as recent breakthroughs not previously available in book form. Theory of Computational Complexity offers a thorough presentation of the fundamentals of complexity theory, including NP-completeness theory, the polynomial-time hierarchy, relativization, and the application to cryptography. It also examines the theory of nonuniform computational complexity, including the computational models of decision trees and Boolean circuits, and the notion of polynomial-time isomorphism.

Note 1: If you can not open the ed file, and your Adobe Reader reports on the damaged file, then update your Adobe Reader. Because I have installed Adobe Reader 8.1.1 and ALL my uploaded files open fine in version 8.1.1.

Note 2: If this publication all links are dead, but you need tofiles from this publication, please send me a private message and I'll try to help you.