Computational complexity : a modern approach / Sanjeev Arora, Boaz Barak.

By: Arora, SanjeevContributor(s): Barak, BoazMaterial type: TextTextPublication details: New York : Cambridge University Press, 2010. Description: XXIV, 579 p. : il. ; 27 cmISBN: 978-0-521-42426-4Subject(s): Computational complexity | Complejidad computacional
Contents:
Í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?
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Home library Call number URL Status Date due Barcode Item holds Course reserves
Manuales 03. BIBLIOTECA INGENIERÍA PUERTO REAL
519.6/ARO/com (Browse shelf(Opens below)) Texto completo Available   Shelving location | Bibliomaps® 3744060220

COMPLEJIDAD COMPUTACIONAL GRADO EN INGENIERÍA INFORMÁTICA Actualizada_2024

Total holds: 0

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?

There are no comments on this title.

to post a comment.

Powered by Koha