Gems of Theoretical Computer Science - Tapa blanda

Schöning, Uwe; Pruim, Randall J.

 
9783642643521: Gems of Theoretical Computer Science

Sinopsis

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.

"Sinopsis" puede pertenecer a otra edición de este libro.

De la contraportada

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.

"Sobre este título" puede pertenecer a otra edición de este libro.

Otras ediciones populares con el mismo título

9783540644255: GEMS OF THEORETICAL COMPUTER SCIENCE

Edición Destacada

ISBN 10:  3540644253 ISBN 13:  9783540644255
Editorial: Springer Verlag, 1998
Tapa dura