Theoretical computer science: introducti
β Juraj Hromkovic
π Library
π
2004
π Springer
π English
β¦ LIBER β¦
π
Theoretical Computer Science: Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography
β Scribed by Juraj Hromkovic
- Publisher
- Springer
- Year
- 2003
- Tongue
- English
- Leaves
- 162
- Series
- Texts in Theoretical Computer Science. An EATCS Series
- Edition
- 1
- Category
- Library
β¬ Acquire This Volume
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Theoretical Computer Science: Introducti
β 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
Computer-Mediated Communication: A Theor
β 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
β Troy Lee, Adi Shraibman
π Library
π
2009
π Now Publishers Inc
π English
Ideals, Varieties, and Algorithms: An In
β David A. Cox, John Little, Donal OβShea
π Library
π
1997
π Springer New York
π English
Ideals, Varieties, and Algorithms: An In
β David A. Cox, John Little, Donal OβShea
π Library
π
2007
π Springer-Verlag New York
π English
<p><P>Algebraic Geometry is the study of systems of polynomial equations in one or more variables, asking such questions as: Does the system have finitely many solutions, and if so how can one find them? And if there are infinitely many solutions, how can they be described and manipulated? </P><P></