Gems of Theoretical Computer Science. This item is unavailable.
Schöning, Uwe; Pruim, Randall J.
6 ratings by Goodreads
Language: English
Published by Springer, 2011
- Softcover
- New
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
5-star seller
AbeBooks seller since March 25, 2015
Unavailable
Softcover
Condition: New
US$ 162.96
Item description from seller
In English.
Seller Inventory # ria9783642643521_new
- Title
- Gems of Theoretical Computer Science
- Author
- Schöning, Uwe; Pruim, Randall J.
- Publisher
- Springer
- Publication year
- 2011
- Condition
- New
- Binding
- Soft cover
- Language
- English
- ISBN 10
- 3642643523
- ISBN 13
- 9783642643521
- Item weight
- 593 grams
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 the title" may belong to another edition of this title.
Search results for Gems of Theoretical Computer Science
There are 1 more copies of this bookView all results