Theoretical computer science. Introduction to automata, computability, complexity, algorithmics, randomization, communication, and cryptography. (Q1415059)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Theoretical computer science. Introduction to automata, computability, complexity, algorithmics, randomization, communication, and cryptography. |
scientific article; zbMATH DE number 2012499
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Theoretical computer science. Introduction to automata, computability, complexity, algorithmics, randomization, communication, and cryptography. |
scientific article; zbMATH DE number 2012499 |
Statements
Theoretical computer science. Introduction to automata, computability, complexity, algorithmics, randomization, communication, and cryptography. (English)
0 references
3 December 2003
0 references
computation theory
0 references
computability
0 references
automata theory
0 references
complexity
0 references
NP-completeness
0 references
approximation
0 references
randomization
0 references
cryptography
0 references
interconnection network design
0 references
