Theory of Computation | Professional literature for training, studies and practice

In the Theoretical Computer Science category, you will find foundational works on formal languages, computability, complexity theory, and algorithmic methods. The titles cover topics such as formal logic, automata, quantum algorithms, cryptography, and the mathematical foundations of computer science. The target audience includes students, faculty, and professionals engaged with theoretical models, proof techniques, and their practical applications.

Typical types of works include textbooks, introductory texts with exercises, handbooks, and scientific treatises. The content ranges from classical fundamentals to current developments such as quantum computing or algorithmic game theory.