Best Reference Books for Computational Complexity

by BuildMyVocab

List of "Best Reference Books for Computational Complexity" compiled based on Amazon book reviews by experts. These books are used by students of top institutes, universities, colleges and professionals. Please feel free to suggest any other book on this topic using the comment section below.

  1. COMPUTATIONAL COMPLEXITY A MODERN APPROACH by SANJEEV ARORA
    Cambridge University Press
  2. Computational Complexity: A Conceptual Perspective: 0 by Oded Goldreich
    Cambridge University Press (Number of pages: 632)
  3. Introduction to Computation and Programming Usin – With Application to Understanding Data by John V. Guttag
    MIT Press (Number of pages: 472)
  4. Logical Foundations of Mathematics and Computational Complexity: A Gentle Introduction (Springer Monographs in Mathematics) by Pavel Pudlák
    Springer (Number of pages: 695)
  5. Chaos by James Gleick
    RHUK (Number of pages: 380)
  6. Algebraic Systems of Equations and Computational Complexity Theory (Mathematics and Its Applications) by Z. Wang,S. Xu,T. Gao
    Springer (Number of pages: 244)
  7. Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity (Natural Computing Series) by Frank Neumann,Carsten Witt
    Springer (Number of pages: 216)
  8. Randomness and Completeness in Computational Complexity (Lecture Notes in Computer Science) by Dieter van Melkebeek
    Springer (Number of pages: 198)
  9. The Computational Complexity of Equivalence and Isomorphism Problems (Lecture Notes in Computer Science) by Thomas Thierauf
    Springer (Number of pages: 135)
  10. The Computational Complexity of Logical Theories (Lecture Notes in Mathematics) by J. Ferrante,C. W. Rackoff
    Springer (Number of pages: 244)

Discuss anything about "Best Reference Books for Computational Complexity" below. Submit your favourite books on the topic using the comment section below.