Our basic text for standard complexity theory
will be my manuscript,
Introduction to Complexity Classes, which
you can download.
For the theory of real computation, we will use
``Computational Complexity of Real Function'' by
publisher, it costs $98. I got a good second-hand for $34.
I have asked our Library to purchase a copy.
Ko has a site ker-i ko
which has two more recent surveys on the area.
For quantum complexity, we will provide our own
Other suggested references:
STANDARD COMPLEXITY THEORY
``Computational Complexity'' by
This book has a fairly good introduction to the logic
aspects of complexity theory, but we will not need it.
``Intro to the Theory of Computation''
by Michael Sipser, PWS Publishing (1997).
This book is a good
place to pick up the basics in finite automata,
formal languages and recursive function theory.
``Theory of Computational Complexity''
by Ding-Zhu Du and Ker-I Ko.
John Wiley & Sons, Inc. (2000).
``The Complexity Theory Companion''
by Lane A. Hemaspaandra and Mitsunori Ogihara.
by Klaus Weihrauch. Springer, Berlin, 2000.
This explains the analytic approach to real computation.
Weihrauch has an introductory book availablable on the web.
``Complexity and Real Computations''
by L.Blum, F.Cucker, M.Shub and S.Smale.
Springer, New York, 1998.
This explains the algebraic approach to real computation.
``Quantum Computation and Quantum Information''
by Michael A. Nielsen and Isaac L. Chuang.
Cambridge University Press, 2000.
``Quantum Computing'' by Jozef Gruska,