A rescued public library · 1,230 legally free books

FreeTechBooks.org

Theory of Computation

Complexity of Algorithms

  • 1999
  • 242 pages

Opens the author, publisher or archive page. FreeTechBooks does not host the file.

The original source link may be offline. Try the archived copy when available.

Cover of Complexity of Algorithms

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.

Bibliographic record recovered from the original FreeTechBooks listing. View archived source.

About the author

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.

2 books in the catalog