Visit our Christmas Gift Finder
Click & Collect from 2 Hours*
Free Delivery to UK Shops
Free UK Standard Delivery On all orders £20 and over Free Delivery to UK Shops Local shops and expert booksellers nationwide Free Click & Collect to UK shops From 2 hours of your order*
Theory of Computational Complexity - Wiley Series in Discrete Mathematics and Optimization (Hardback)
  • Theory of Computational Complexity - Wiley Series in Discrete Mathematics and Optimization (Hardback)
zoom

Theory of Computational Complexity - Wiley Series in Discrete Mathematics and Optimization (Hardback)

(author), (author)
£128.00
Hardback Published: 08/02/2000
  • Not available

This product is currently unavailable.

  • This item has been added to your basket
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. The theory of probabilistic complexity, which studies complexity issues related to randomized computation as well as interactive proof systems and probabilistically checkable proofs, is also covered. Extraordinary in both its breadth and depth, this volume: Provides complete proofs of recent breakthroughs in complexity theory Presents results in well-defined form with complete proofs and numerous exercises Includes scores of graphs and figures to clarify difficult material An invaluable resource for researchers as well as an important guide for graduate and advanced undergraduate students, Theory of Computational Complexity is destined to become the standard reference in the field.

Publisher: John Wiley & Sons Inc
ISBN: 9780471345060
Weight: 878 g
Dimensions: 243 x 166 x 33 mm

You may also be interested in...

Logic for Computer Science
Added to basket
Discrete Mathematics for Computing
Added to basket
Sets, Logic and Maths for Computing
Added to basket
Bayesian Methods for Hackers
Added to basket
Concrete Mathematics
Added to basket
Discrete Mathematics
Added to basket
Lambda-Calculus and Combinators
Added to basket
Data Analysis with Open Source Tools
Added to basket
The Algorithm Design Manual
Added to basket
Modelling Computing Systems
Added to basket
MATLAB Demystified
Added to basket
£21.99
Paperback
Boosting
Added to basket
£32.00
Paperback
Foundation Mathematics
Added to basket
Discrete Mathematics for Computing
Added to basket

Please sign in to write a review

Your review has been submitted successfully.