Skip to main content Site map

Theoretical Computer Science: Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography Softcover reprint of hardcover 1st ed. 2011


Theoretical Computer Science: Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography Softcover reprint of hardcover 1st ed. 2011

Paperback by Hromkovic, Juraj

Theoretical Computer Science: Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography

WAS £89.99   SAVE £13.50

£76.49

ISBN:
9783642057298
Publication Date:
6 Dec 2010
Edition/language:
Softcover reprint of hardcover 1st ed. 2011 / English
Publisher:
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Imprint:
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Pages:
313 pages
Format:
Paperback
For delivery:
Estimated despatch 6 - 11 May 2024
Theoretical Computer Science: Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography

Description

The aim of this textbook is not only to provide an elegant route through the theoretical fundamentals of computer science, but also to show that theoretical computer science is a fascinating discipline, full of spectacular contributions and miracles, and depth in research, and yet directly applicable. Thus, we aim to excite people about its study. To achieve these goals we do not hesitate to take a lot of space to present motivations, and especially to give the informal development of crucial ideas and concepts and their transparent, but rigorous presentation. An additional aim is to present the development of the computer scientist's way of thinking, so we do not restrict this book to the classic areas like computability and automata theory but we also present fundamental concepts such as approximation and randomization in algorithmics and we explain the basic ideas of cryptography and interconnection network design.

Contents

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

Back

JS Group logo