Gems of Theoretical Computer Science
Published on 29. September 1998
Book
Hardback
X, 320 pages
978-3-540-64425-5 (ISBN)
Description
This book assembles some of the most important problems and solutions in theoretical computer science-from computability, logic, circuit theory, and complexity. The book presents these important results with complete proofs in an understandable form. It also presents previously open problems that have found (perhaps unexpected) solutions, and challenges the reader to pursue further active research in computer science.
More details
Language
English
Place of publication
Heidelberg
Germany
Publishing group
Springer Berlin
Target group
College/higher education
Professional and scholarly
Illustrations
illustrations
Dimensions
Height: 23.5 cm
Width: 15.5 cm
Weight
625 gr
ISBN-13
978-3-540-64425-5 (9783540644255)
DOI
10.1007/978-3-642-60322-8
Schweitzer Classification
Other editions
Additional editions
Uwe Schöning | Randall J. Pruim
Gems of Theoretical Computer Science
E-Book
12/2012
Springer
€117.69
Available for download
Uwe Schöning | Randall J. Pruim
Gems of Theoretical Computer Science
Book
09/2011
Springer
€128.39
Shipment within 7-9 days
Persons
Content
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.