• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Computational Complexity

Computational Complexity

Hardcover

FictionGeneral Computers

ISBN10: 052188473X
ISBN13: 9780521884730
Publisher: Cambridge University Press
Published: Apr 28 2008
Pages: 632
Weight: 2.76
Height: 1.60 Width: 7.02 Depth: 10.13
Language: English
This book offers a comprehensive perspective to modern topics in complexity theory, which is a central field of the theoretical foundations of computer science. It addresses the looming question of what can be achieved within a limited amount of time with or without other limited natural computational resources. Can be used as an introduction for advanced undergraduate and graduate students as either a textbook or for self-study, or to experts, since it provides expositions of the various sub-areas of complexity theory such as hardness amplification, pseudorandomness and probabilistic proof systems.

Also in

General Computers