Best Reference Books for Computational Complexity
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.
- COMPUTATIONAL COMPLEXITY A MODERN APPROACH by SANJEEV ARORACambridge University Press
- Computational Complexity: A Conceptual Perspective: 0 by Oded GoldreichCambridge University Press (Number of pages: 632)
- Introduction to Computation and Programming Usin – With Application to Understanding Data by John V. GuttagMIT Press (Number of pages: 472)
- Logical Foundations of Mathematics and Computational Complexity: A Gentle Introduction (Springer Monographs in Mathematics) by Pavel PudlákSpringer (Number of pages: 695)
- Chaos by James GleickRHUK (Number of pages: 380)
- Algebraic Systems of Equations and Computational Complexity Theory (Mathematics and Its Applications) by Z. Wang,S. Xu,T. GaoSpringer (Number of pages: 244)
- Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity (Natural Computing Series) by Frank Neumann,Carsten WittSpringer (Number of pages: 216)
- Randomness and Completeness in Computational Complexity (Lecture Notes in Computer Science) by Dieter van MelkebeekSpringer (Number of pages: 198)
- The Computational Complexity of Equivalence and Isomorphism Problems (Lecture Notes in Computer Science) by Thomas ThieraufSpringer (Number of pages: 135)
- The Computational Complexity of Logical Theories (Lecture Notes in Mathematics) by J. Ferrante,C. W. RackoffSpringer (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.