Gems of Theoretical Computer Science
Autor Uwe Schöning Traducere de R. Pruim Autor Randall J. Pruimen Limba Engleză Paperback – 19 sep 2011
Preț: 761.29 lei
Preț vechi: 951.62 lei
-20% Nou
Puncte Express: 1142
Preț estimativ în valută:
145.69€ • 151.18$ • 121.77£
145.69€ • 151.18$ • 121.77£
Carte tipărită la comandă
Livrare economică 15-29 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783642643521
ISBN-10: 3642643523
Pagini: 336
Ilustrații: X, 320 p.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.47 kg
Ediția:Softcover reprint of the original 1st ed. 1998
Editura: Springer Berlin, Heidelberg
Colecția Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3642643523
Pagini: 336
Ilustrații: X, 320 p.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.47 kg
Ediția:Softcover reprint of the original 1st ed. 1998
Editura: Springer Berlin, Heidelberg
Colecția Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Fundamental Definitions and Results.- 1. The Priority Method.- 2. Hilbert’s Tenth Problem.- 3. The Equivalence Problem for LOOP(l)- and LOOP(2)-Programs.- 4. The Second LBA Problem.- 5. LOGSPACE, Random Walks onGraphs, and Universal Traversal Sequences.- 6. Exponential Lower Bounds for the Length of Resolution Proofs.- 7. Spectral Problems and Descriptive Complexity Theory.- 8. Kolmogorov Complexity, the Universal Distribution, and Worst-Case vs. Average-Case.- 9. Lower Bounds via Kolmogorov Complexity.- 10. PAC-Learning and Occam’s Razor.- 11. Lower Bounds for the Parity Function.- 12. The Parity Function Again.- 13. The Complexity of Craig Interpolants Ill.- 14. Equivalence Problems and Lower Bounds for Branching Programs.- 15. The Berman-Hartmanis Conjecture and Sparse Sets.- 16. Collapsing Hierarchies.- 17. Probabilistic Algorithms, Probability Amplification, and the Recycling of Random Numbers.- 18. The BP Operator and Graph Isomorphism.- 19. The BP-Operator and the Power of Counting Classes.- 20. Interactive Proofs and Zero Knowledge.- 21. IP = PSPACE.- 22. P ? NP with probability 1.- 23. Superconcentrators and the Marriage Theorem.- 24. The Pebble Game.- 25. Average-Case Complexity.- 26. Quantum Search Algorithms.- Solutions.
Textul de pe ultima copertă
This book introduces some of the most important results in theoretical computer science. The "gems" are central problems and their solutions from the areas of computability, logic, circuit theory, and complexity. The text presents complete proofs in understandable form, as well as previously open problems that have found a (perhaps unexpected) solution, complex proofs from bottom drawers, probabilistic constructions, and much, much more. With over 240 intriguing exercises (elegant solutions for which are supplied), the text also challenges the reader to do some active work.
Caracteristici
Compilation of the most glorious episodes from the annals of theoretical computer science * Over 240 fascinating exercises with elegant solutions on the centrals themes of theoretical computer science