Synopses & Reviews
Juraj Hromkovic takes the reader on an elegant route through the theoretical fundamentals of computer science. The author shows that theoretical computer science is a fascinating discipline, full of spectacular contributions and miracles. The book also presents the development of the computer scientist's way of thinking as well as fundamental concepts such as approximation and randomization in algorithmics, and the basic ideas of cryptography and interconnection network design.
Synopsis
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.
Synopsis
Introduction; Alphabets, Words, Languages and Algorithmic Problems; Finite Automata; Turing Machines; Computability; Complexity Theory; Algorithmics for Hard Problems; Randomization; Communication and Cryptography; References.
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.
Table of Contents
Introduction; Alphabets, Words, Languages and Algorithmic Problems; Finite Automata; Turing Machines; Computability; Complexity Theory; Algorithmics for Hard Problems; Randomization; Communication and Cryptography; References.