Randomness and Completeness in Computational Complexity - Lecture Notes in Computer Science - Dieter Van Melkebeek - Books - Springer-Verlag Berlin and Heidelberg Gm - 9783540414926 - December 13, 2000
In case cover and title do not match, the title is correct

Randomness and Completeness in Computational Complexity - Lecture Notes in Computer Science 2000 edition

Dieter Van Melkebeek

Price
€ 70.49

Ordered from remote warehouse

Expected delivery Feb 5 - 14

Our customers say:

14-day return policy in accordance with European consumer protection law
Top ranking on Trustpilot
Add to your iMusic wish list

Randomness and Completeness in Computational Complexity - Lecture Notes in Computer Science 2000 edition

This text, based on the author's competition-winning PhD thesis, studies central issues in computational complexity: the relative power of time, space, and randomness in computing and verification. He presents approaches based on such concepts as density, redundancy, and frequency of occurrence.

198 pages, biography

Media Books     Paperback Book   (Book with soft cover and glued back)
Released December 13, 2000
ISBN13 9783540414926
Publishers Springer-Verlag Berlin and Heidelberg Gm
Pages 198
Dimensions 156 × 234 × 11 mm   ·   312 g
Language English  
Show all

More by Dieter Van Melkebeek

See all of Dieter Van Melkebeek ( e.g. Paperback Book )