Theoretical computer science. Introduction to automata, computability, complexity, algorithmics, randomization, communication, and cryptography.
From MaRDI portal
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)
complexityautomata theoryrandomizationapproximationcryptographyNP-completenesscomputabilitycomputation theoryinterconnection network design
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
A Modern View on Stability of Approximation ⋮ Towards implementation of a generalized architecture for high-level quantum programming language ⋮ Unnamed Item ⋮ Alan Turing and the Foundation of Computer Science ⋮ On the complexity of solution extension of optimization problems
This page was built for publication: Theoretical computer science. Introduction to automata, computability, complexity, algorithmics, randomization, communication, and cryptography.
