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.
Tag(s): Theory of Computation
Publication date: 31 Dec 1999
ISBN-10: n/a
ISBN-13: n/a
Paperback: 242 pages
Views: 25,761
Type: N/A
Publisher: n/a
License: n/a
Post time: 09 Dec 2006 07:38:21
Complexity of Algorithms
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.