Name: randomness and completeness in computational complexity
SKU: 3484628
Price: 1890.00 TWD
Availability: InStock
Author: melkebeek

Select your country

Americas

Europe

Rest of the world

portada randomness and completeness in computational complexity

randomness and completeness in computational complexity

Type

Physical Book

Publisher

Springer

Author

melkebeek

Language

English

Pages

196

ISBN

3540414924

ISBN13

9783540414926

Synopsis "randomness and completeness in computational complexity"

this book is based on the authors ph.d. thesis which was selected as the winning thesis of the 1999 acm doctoral dissertation competition. dieter van melkebeek did his ph.d. work at the university of chicago with lance fortnow as thesis advisor. this work studies some central issues in computational complexity: the relative power of time, space, and randomness in computing and verification. the author develops techniques for separating complexity classes by isolating structural differences between their complete problems. he presents several approaches based on such diverse concepts as density, redundancy, and frequency of occurrence.