Theoretical computer science. Introduction to automata, computability, complexity, algorithmics, randomization, communication, and cryptography.
Publication:1415059
zbMath1113.68001MaRDI QIDQ1415059
Publication date: 3 December 2003
Published in: Texts in Theoretical Computer Science. An EATCS Series (Search for Journal in Brave)
complexity; automata theory; randomization; approximation; cryptography; NP-completeness; computability; computation theory; interconnection network design
68Q25: Analysis of algorithms and problem complexity
68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
68Q45: Formal languages and automata
94A60: Cryptography
68P25: Data encryption (aspects in computer science)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68W25: Approximation algorithms
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
68W20: Randomized algorithms
Related Items