A List of Books in Computational Complexity
- Michael Sipser, Introduction to the Theory of Computation, Third Edition, Cengage Learning, 2013
- Christos H. Papadimitriou, Computational Complexity, Addison-Wesley Publishing Company, 1994
- Sanjeev Arora and Boaz Barak, Computational Complexity A Modern Approach, Cambridge University Press, 2009
- Avi Wigderson, Mathematics + Computation A Theory Revolutionizing Technology and Science, Princeton University Press, 2019
- Oded Goldreich, Computational Complexity A Conceptual Perspective, Cambridge University Press, 2008
- Cristopher Moore and Stephan Mertens, The Nature of Computation, Oxford University Press, 2011
- Ingo Wegener, Complexity Theory Exploring the Limits of Efficient Algorithms, Springer, 2008
- Ding-Zhu Du and Ker-I Ko, Theory of Computational Complexity, Second Edition, John Wiley & Sons, 2014
- Ingo Wegener, The Complexity of Boolean Functions, John Wiley & Sons, 1987
- Stasys Jukna, Boolean Function Complexity Advances and Frontiers, Springer, 2012
- Jan Krajicek, Bounded Arithmetic, Propositional
Logic and Complexity Theory, Encyclopedia of Mathematics and Its
Applications 60, Cambridge University Press, 1995
Some Books on Special Topics
- Rajeev Motwani and Prabhakar Raghavan, Randomized Algorithms, Cambridge University Press, 1995
- Vijay V. Vazirani, Approximation Algorithms, Springer, 2003
- Oded Goldreich, Foundations of Cryptography Volume I Basic Tools, Cambridge University Press, 2001
- Oded Goldreich, Foundations of Cryptography Volume II Basic Applications, Cambridge University Press, 2004
- Michael A. Nielsen and Isaac L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, 2010
- Eyal Kushilevitz and Noam Nisan, Communication Complexity, Cambridge University Press, 2006
- Anup Rao and Amir Yehudayoff, Communication Complexity and Applications, Cambridge University Press, 2020