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

Price loading...

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

Name: Theory of Computational Complexity (Wiley Series in Discrete Mathematics and Optimization)
Brand: Wiley

illustrations

Discrete Mathematics

Price History & Forecast

No Price Data Available

Price history will appear here once data is collected from Amazon.

Price Distribution

No price data available for histogram

Description

Praise for the First Edition "... complete, up-to-date coverage of computational complexity theory...the book promises to become the standard reference on computational complexity." ―Zentralblatt MATH A thorough revision based on advances in the field of computational complexity and readers’ feedback, the Second Edition of Theory of Computational Complexity presents updates to the principles and applications essential to understanding modern computational complexity theory. The new edition continues to serve as a comprehensive resource on the use of software and computational approaches for solving algorithmic problems and the related difficulties that can be encountered. Maintaining extensive and detailed coverage, Theory of Computational Complexity, Second Edition, examines the theory and methods behind complexity theory, such as computational models, decision tree complexity, circuit complexity, and probabilistic complexity. The Second Edition also features recent developments on areas such as NP-completeness theory, as well as: A new combinatorial proof of the PCP theorem based on the notion of expander graphs, a research area in the field of computer science Additional exercises at varying levels of difficulty to further test comprehension of the presented material End-of-chapter literature reviews that summarize each topic and offer additional sources for further study Theory of Computational Complexity, Second Edition, is an excellent textbook for courses on computational theory and complexity at the graduate level. The book is also a useful reference for practitioners in the fields of computer science, engineering, and mathematics who utilize state-of-the-art software and computational methods to conduct research.

Product Specifications

Brand: Wiley
Model: illustrations
Format: hardcover
ASIN: 1118306082
Category: Books > Subjects > Science, Nature & Maths > Mathematics > Discrete Mathematics
Domain: Amazon UK
Release Date: 11 July 2014
Listed Since: 19 May 2012

Barcode

No barcode data available

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

Price History & Forecast

No Price Data Available

Price Distribution

Description

Product Specifications

Barcode

Similar Products You Might Like

Theory of Computation (Texts in Computer Science)

Theory of Computation

Theory of Computation: Automata, Formal Languages, Computation and Complexity

Wiley Discrete Mathematics with Proof - Second Edition

Computational Complexity: A Conceptual Perspective

Computational Complexity: A Modern Approach

The Foundations of Computability Theory

The Complexity Theory Companion (Texts in Theoretical Computer Science. An EATCS Series)

Introduction To Computational Mathematics (2nd Edition): Second Edition

A Walk Through Combinatorics: An Introduction to Enumeration and Graph Theory (Second Edition)

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Computability Theory: An Introduction to Recursion Theory

Walk Through Combinatorics, A: An Introduction To Enumeration And Graph Theory: An Introduction to Enumeration and Graph Theory (Second Edition)

Extremal Combinatorics: With Applications in Computer Science (Texts in Theoretical Computer Science. An EATCS Series)

Wiley Ramsey Theory, Second Edition - Mathematics Textbook

Introduction To Computational Mathematics (2Nd Edition): Second Edition

CRC Press Combinatorics: Discrete Mathematics and Applications

Graphs, Networks and Algorithms: 5 (Algorithms and Computation in Mathematics, 5)

Classical Recursion Theory, Volume II (Volume 143) (Studies in Logic and the Foundations of Mathematics, Volume 143)

The Nature of Computation

Theoretical Computer Science: Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography

Distributed Computing Through Combinatorial Topology

Integer Programming, 2nd Edition

How to Count: An Introduction to Combinatorics, Second Edition (Discrete Mathematics & Its Application)