-
Anglický jazyk
Computational Complexity
Autor: Sanjeev Arora
Describes recent achievements and classical results of computational complexity theory, including interactive proofs, PCP, derandomization, and quantum computation. It can be used as a reference, for self-study, or as a beginning graduate textbook. More... Viac o knihe
1 kus skladom u vydavateľa Posielame do 7-10 dní
43.44 €
bežná cena: 48.27 €
O knihe
Describes recent achievements and classical results of computational complexity theory, including interactive proofs, PCP, derandomization, and quantum computation. It can be used as a reference, for self-study, or as a beginning graduate textbook. More than 300 exercises are included.
- Vydavateľstvo: Cambridge University Pr.
- Rok vydania: 2009
- Formát: Hardback
- Rozmer: 257 x 182 mm
- Jazyk: Anglický jazyk
- ISBN: 9780521424264
Nemecký jazyk 
