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 pr
Gems of theoretical computer science
β Scribed by Schoning, Uwe
- Publisher
- Springer
- Year
- 2012
- Tongue
- English
- Leaves
- 317
- Category
- Library
No coin nor oath required. For personal study only.
β¦ Table of Contents
The Priority Method.- Hilbert's Tenth Problem.- LOOP Programs.- Bottom Drawers for Resolution Proofs.- The Spectral Problem.- Kolmogorov Complexity.- Circuits for the Parity Function.- PAC Learning.- The Berman-Hartmanis Conjecture.- Collaborating Hierarchies.- Equivalence of Branching Programs.- Craig Interpolants.- Probability Amplification.- Interactive Proof Systems.- Zero Knowledge.- Graph Isomorphism.- Superconcentrations.- Pebble Game.
π SIMILAR VOLUMES
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 pr
ΠΠ·Π΄Π°ΡΠ΅Π»ΡΡΡΠ²ΠΎ Springer, 1998, -327 pp.<div class="bb-sep"></div>In the summer semester of 1993 at UniversitΓ€t Ulm, I tried out a new type of course, which I called Theory lab, as part of the computer science major program. As in an experimental laboratory with written preparatory materials (including
<span>Using basic category theory, this Element describes all the central concepts and proves the main theorems of theoretical computer science. Category theory, which works with functions, processes, and structures, is uniquely qualified to present the fundamental results of theoretical computer sc
Explores basic concepts of theoretical computer science and shows how they apply to current programming practice. Coverage ranges from classical topics, such as formal languages, automata, and compatibility, to formal semantics, models for concurrent computation, and program semantics.