Péter Gács

Péter Gács

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.

Back to all authors

Books Authored by Péter Gács

Computation Complexity

Post date: 21 Mar 2007
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.
Publication date: 15 Mar 1994
 
Computation Complexity

Computation Complexity

Post date: 21 Mar 2007
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.
Publication date: 15 Mar 1994


Complexity of Algorithms

Post date: 09 Dec 2006
These notes deal with the foundations of measuring the complexity of a problem, algorithm or structure used in computer science, the traditional branches of mathematics, statistical physics, biology, medicine, social sciences and engineering.
Publication date: 31 Dec 1999
 
Complexity of Algorithms

Complexity of Algorithms

Post date: 09 Dec 2006
These notes deal with the foundations of measuring the complexity of a problem, algorithm or structure used in computer science, the traditional branches of mathematics, statistical physics, biology, medicine, social sciences and engineering.
Publication date: 31 Dec 1999


Book Categories
Sponsors
Icons8, a free icon pack