|
 |
|
 |
 |
Theoretical Computer Science: Introduction to Automata, Computability, Complexity,...
|
by Juraj Hromkovic
Sales Rank: 1181201
|
Discount: 20 %
List Price: $84.95
$63.00
At Amazon
|
|
Hardcover: 313 pages
Publisher: Springer; 1 edition November 5, 2003
Language: English
ISBN-10: 3540140158
ISBN-13: 978-3540140153
Product Dimensions:
9.4 x 6.3 x 0.9 inches
Shipping Weight: 1.2 pounds
Book Description
This textbook not only provides an elegant route through the theoretical fundamentals of computer science, it also shows that theoretical computer science is a fascinating discipline, full of spectacular contributions and miracles, depth of research, and yet directly applicable. It presents the development of the computer scientist's way of thinking: detailing such classic areas as computability and automata theory as well as such fundamental concepts as approximation and randomization in algorithmics. Coverage also explains the basic ideas of cryptography and interconnection network design.
About The Author
Also Author of our books "Communication Complexity and Parallel Computing", 57459-X and "Algorithmics for Hard Problems" 2nd ed., 44134-4; Advisory Board member of the EATCS series.
|
Theoretical Computer Science: Introduction to Automata, Computability, Complexity,...
List Price: $84.95
Discount: 20 %
Available from Amazon
Price: $63.00
| |
|
|
|
|
