99,03 €
123,79 €
Computational Complexity
99,03 € 
- Išsiųsime per 10–14 d.d.
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.
99.03
2025-06-29 23:59:00
/https://libri-media.knygos-static.lt/e9ca8057-3074-45e3-84a2-09e0c40c29ff/4)
- Autorius: Sanjeev Arora, Boaz Barak
- Leidėjas: Cambridge University Pr.
- Metai: 2009
- ISBN-10: 0521424267
- ISBN-13: 9780521424264
- Formatas: 18.4 x 26.5 x 4 cm, kieti viršeliai
- Kalba: Anglų
- Extra -20 % nuolaida šiai knygai su kodu ENG20
Atsiliepimai
Aprašymas
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 20 % nuolaida
99,03 €
123,79 €
Išsiųsime per 10–14 d.d.
Kupono kodas: ENG20
Akcija baigiasi už 3d.02:30:18
Nuolaidos kodas galioja perkant nuo 10 €. Nuolaidos nesumuojamos.
- Autorius: Sanjeev Arora, Boaz Barak
- Leidėjas: Cambridge University Pr.
- Metai: 2009
- ISBN-10: 0521424267
- ISBN-13: 9780521424264
- Formatas: 18.4 x 26.5 x 4 cm, kieti viršeliai
- Kalba: Anglų
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.
Atsiliepimai