Theoretical Computer Science

Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography
2011
ISBN: 978-3-540-14015-3
Verlag: Springer Berlin Heidelberg

Buch, Englisch, 313 Seiten, Format (B × H): 160 mm x 241 mm, Gewicht: 1420 g

Reihe: Texts in Theoretical Computer Science. An EATCS Series

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.

Zielgruppe

Research

Autoren/Hrsg.

Hromkovi¿, Juraj

Hromkovic, Juraj

Fachgebiete

• Mathematik | Informatik EDV | Informatik Informatik Theoretische Informatik

Inhaltsverzeichnis

Introduction; Alphabets, Words, Languages and Algorithmic Problems; Finite Automata; Turing Machines; Computability; Complexity Theory; Algorithmics for Hard Problems; Randomization; Communication and Cryptography; References.

Über Autor(innen)

 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.