113,03 €
125,59 €
-10% with code: EXTRA
Computational Complexity
113,03 € 
- We will send in 10–14 business days.
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.
125.59
/https://libri-media.knygos-static.lt/e9ca8057-3074-45e3-84a2-09e0c40c29ff/4)
- Author: Sanjeev Arora, Boaz Barak
- Publisher: Cambridge University Pr.
- Year: 2009
- ISBN-10: 0521424267
- ISBN-13: 9780521424264
- Format: 18.4 x 26.5 x 4 cm, kieti viršeliai
- Language: English
- SAVE -10% with code: EXTRA
Reviews
Description
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.
EXTRA 10 % discount with code: EXTRA
113,03 €
125,59 €
We will send in 10–14 business days.
The promotion ends in 24d.06:02:39
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: Sanjeev Arora, Boaz Barak
- Publisher: Cambridge University Pr.
- Year: 2009
- ISBN-10: 0521424267
- ISBN-13: 9780521424264
- Format: 18.4 x 26.5 x 4 cm, kieti viršeliai
- Language: English English
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.
Reviews