Theoretical computer science
Subtitle: introduction to Automata, compurability, complexity, algorithmics, randomization, communication, and cryptography
By: Juraj Hromkovic̆.
Series: Texts in theoretical computer science, an EATCS series; Texts in theoretical computer science
Publisher: Springer
Published: 2004
Place of publication: Berlin; New York
Language: eng
Number of pages: 313
ISBN-13: 9783540140153
Subjects: Computer science; Informatique
Notes: Includes bibliographical references (p. [305]-308) and index.
Table of contents: title: Introduction : what is computer science?; title: Alphabets, words, languages, and algorithmic problems; title: Finite automata; title: Turing machines; title: Computability; title: Complexity theory; title: Algorithmics for hard problems; title: Randomization; title: Communication and cryptography.