Computation Complexity
These notes deal with the foundations of complexity theory for a one-semester graduate course. Part of it is also suitable for an undergraduate course, at a slower pace. Mathematical maturity is the main prerequisite.
Tag(s): Theory of Computation
Publication date: 15 Mar 1994
ISBN-10: n/a
ISBN-13: n/a
Paperback: 169 pages
Views: 18,668
Type: Lecture Notes
Publisher: n/a
License: n/a
Post time: 21 Mar 2007 08:28:45
Computation Complexity
About The Author(s)
Péter Gács is a Professor in the Computer Science Department of the Boston University. His research interests are fault-tolerant cellular automata, algorithmic information theory, computational complexity theory, and quantum information theory.
Péter Gács is a Professor in the Computer Science Department of the Boston University. His research interests are fault-tolerant cellular automata, algorithmic information theory, computational complexity theory, and quantum information theory.
László Lovász is a Professor in the Department of Computer Science of the Eötvös Loránd University in Budapest, Hungary. His research topics cover combinatorial optimization, algorithms, complexity, graph theory, and random walks.
László Lovász is a Professor in the Department of Computer Science of the Eötvös Loránd University in Budapest, Hungary. His research topics cover combinatorial optimization, algorithms, complexity, graph theory, and random walks.