Descrizione
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.
Dettagli del libro
Formato
Kindle
Lingua
Inglese
Pubblicato
mag 26, 2008
Editore
Cambridge University Press
Edizioni
2 edizioni
ISBN-10
0511402686
ISBN-13
9780511402685