Theoretical computer science: introduction to Automata, compurability, complexity, algorithmics, randomization, communication, and cryptography

✍ Scribed by Juraj Hromkovic

Publisher: Springer
Year: 2004
Tongue: English
Leaves: 318
Series: Texts in Theoretical Computer Science. An EATCS Series
Category: Library

⬇ Acquire This Volume

No coin nor oath required. For personal study only.

✦ Subjects

Теория конечных автоматов

📜 SIMILAR VOLUMES

Theoretical Computer Science: Introducti

📁 Theoretical Computer Science: Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography

✍ Juraj Hromkovič 📂 Library 📅 2007 🏛 Springer 🌐 English

Juraj Hromkovic takes the reader on an elegant route through the theoretical fundamentals of computer science. The author shows that theoretical computer science is a fascinating discipline, full of spectacular contributions and miracles. The book also presents the development of the computer scient

Theoretical Computer Science: Introducti

📁 Theoretical Computer Science: Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography

✍ Juraj Hromkovic 📂 Library 📅 2003 🏛 Springer 🌐 English

Computer-Mediated Communication: A Theor

📁 Computer-Mediated Communication: A Theoretical and Practical Introduction to Online Human Communication

✍ Caleb T. Carr 📂 Library 📅 2021 🏛 Rowman & Littlefield Publishers 🌐 English

<p><span>As more of our human interaction moves online and facilitated by digital channels, it becomes increasingly important to understand how being online influences how we interact with others and ourselves. This textbook introduces students to the fundamental concepts, theories, and applications

Lower Bounds in Communication Complexity

📁 Lower Bounds in Communication Complexity (Foundations and Trends in Theoretical Computer Science)

✍ Troy Lee, Adi Shraibman 📂 Library 📅 2009 🏛 Now Publishers Inc 🌐 English

Non-commutative cryptography and complex

📁 Non-commutative cryptography and complexity of group-theoretic problems

✍ Alexei Myasnikov, Vladimir Shpilrain, Alexander Ushakov 📂 Library 📅 2011 🏛 American Mathematical Society 🌐 English

This book is about relations between three different areas of mathematics and theoretical computer science: combinatorial group theory, cryptography, and complexity theory. It explores how non-commutative (infinite) groups, which are typically studied in combinatorial group theory, can be used in pu

Ideals, Varieties, and Algorithms: An In

📁 Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra

✍ David A. Cox, John Little, Donal O’Shea 📂 Library 📅 1997 🏛 Springer New York 🌐 English