Computational complexity : a modern approach / Sanjeev Arora, Boaz Barak.
Arora, Sanjeev.
Computational complexity : a modern approach / Sanjeev Arora, Boaz Barak. - New York : Cambridge University Press, 2010. - XXIV, 579 p. : il. ; 27 cm.
P. 549-573.
Índice abreviado: 1. The computational model - and why it doesn't matter 2. NP and NP completeness 3. Diagonalization 4. Space complexity 5. The polynomial hierarchy and alternations 6. Boolean circuits 7. Randomized computation 8. Interactive proofs 9. Cryptography 10. Quantum computation 11. PCP theorem and hardness of approximation: an introduction 12. Decision trees13. Communication complexity 14. Circuit lower bounds: complexity theory's Waterloo 15. Proof complexity 16. Algebraic computation models 17. Complexity of counting 18. Average case complexity: Levin's theory 19. Hardness amplification and error-correcting codes 20. Derandomization 21. Pseudorandom constructions: expanders and extractors 22. Proofs of PCP theorems and the Fourier transform technique 23. Why are circuit lower bounds so difficult?
978-0-521-42426-4
Computational complexity.
Complejidad computacional.
510.52
Computational complexity : a modern approach / Sanjeev Arora, Boaz Barak. - New York : Cambridge University Press, 2010. - XXIV, 579 p. : il. ; 27 cm.
P. 549-573.
Índice abreviado: 1. The computational model - and why it doesn't matter 2. NP and NP completeness 3. Diagonalization 4. Space complexity 5. The polynomial hierarchy and alternations 6. Boolean circuits 7. Randomized computation 8. Interactive proofs 9. Cryptography 10. Quantum computation 11. PCP theorem and hardness of approximation: an introduction 12. Decision trees13. Communication complexity 14. Circuit lower bounds: complexity theory's Waterloo 15. Proof complexity 16. Algebraic computation models 17. Complexity of counting 18. Average case complexity: Levin's theory 19. Hardness amplification and error-correcting codes 20. Derandomization 21. Pseudorandom constructions: expanders and extractors 22. Proofs of PCP theorems and the Fourier transform technique 23. Why are circuit lower bounds so difficult?
978-0-521-42426-4
Computational complexity.
Complejidad computacional.
510.52