Gems of Theoretical Computer Science - Hardcover

Schöning, Uwe; Pruim, Randall J.

  • 4.50 out of 5 stars
    6 ratings by Goodreads
 
9783540644255: Gems of Theoretical Computer Science
Hardcover
ISBN 10: 3540644253 ISBN 13: 9783540644255
Publisher: Springer, 1998

Synopsis

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.

"synopsis" may belong to another edition of this title.

From the Back Cover

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.

"About this title" may belong to another edition of this title.

Publisher
Springer
Publication date
1998
Language
English
ISBN 10 
3540644253
ISBN 13 
9783540644255
Binding
Hardcover
Edition number
1
Number of pages
320
Rating
  • 4.50 out of 5 stars
    6 ratings by Goodreads

Other Popular Editions of the Same Title

9783642643521: Gems of Theoretical Computer Science

Featured Edition

ISBN 10:  3642643523 ISBN 13:  9783642643521
Publisher: Springer, 2011
Softcover