Computational Complexity Hb
Saanjeev Arora
New and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students. . Cambridge Univ Pr: This beginning graduate textbook describes both recent achievements and ...
New and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students. . Cambridge Univ Pr: This beginning graduate textbook describes both recent achievements and
Reseña del Editor
Información de seguridad
- Cargando la información ...