Detail produktu

Produkt mají v nabídce:

Bookshop
1 875 Kč
Do eshopu

Computational Complexity - Arora, Sanjeev (Princeton University, New Jersey) a Barak, Boaz (Princeton University, New Jersey)

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.

Podobné produkty