Theoretical Computer Science: Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography - Image 1

£80.59

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

Name: Theoretical Computer Science: Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography
Brand: Springer
Price: 80.59 GBP
Availability: InStock

Architecture & Microprocessors

This is the usual price. Wait for it to drop, or tell us your number.

£81 today · usual range £0–£0 · best ever £57

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 627 days • 627 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 627 days • 5 price ranges

Days at Price

Current Price

Price Analysis

Most common range: £82-89 (238 days, 38.0%)

Price range: £57 - £89

Price levels: 5 price ranges over 627 days

Description

The aim of this textbook is not only to provide an elegant route through the theoretical fundamentals of computer science, but also to show that theoretical computer science is a fascinating discipline, full of spectacular contributions and miracles, and depth in research, and yet directly applicable. Thus, we aim to excite people about its study. To achieve these goals we do not hesitate to take a lot of space to present motivations, and especially to give the informal development of crucial ideas and concepts and their transparent, but rigorous presentation. An additional aim is to present the development of the computer scientist's way of thinking, so we do not restrict this book to the classic areas like computability and automata theory but we also present fundamental concepts such as approximation and randomization in algorithmics and we explain the basic ideas of cryptography and interconnection network design.

Product Specifications

Brand: Springer
Format: Hardcover
ASIN: 3540140158
Category: Books > Subjects > Computing & Internet > Computer Science > Architecture & Microprocessors
Domain: Amazon UK
Release Date: 18 September 2003
Listed Since: 22 January 2007

Barcode

No barcode data available

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

This is the usual price. Wait for it to drop, or tell us your number.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Theory of Computation (Texts in Computer Science)

Automata and Computability

Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science (Computer Science and Scientific Computing)

Mathematical Foundations of Computer Science

LATIN 2018: Theoretical Informatics: 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings: 10807 (Lecture Notes in Computer Science, 10807)

Automata and Computability (Undergraduate Texts in Computer Science)

Introduction to the Theory of Computation

Introduction to the Theory of Computation

Automata, Universality, Computation: Tribute to Maurice Margenstern: 12 (Emergence, Complexity and Computation, 12)

Automata, Logics, and Infinite Games: A Guide to Current Research: 2500 (Lecture Notes in Computer Science, 2500)

Introduction to the Theory of Computation

Computational Complexity: A Modern Approach

Mathematical Foundations of Computer Science 1998: 23rd International Symposium, MFCS'98, Brno, Czech Republic, August 24-28, 1998: 1450 (Lecture Notes in Computer Science, 1450)

Automata Theory with Modern Applications

What Can Be Computed? – A Practical Guide to the Theory of Computation

Programming-Based Formal Languages and Automata Theory: Design, Implement, Validate, and Prove (Texts in Computer Science)

Automata, Languages and Programming: 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II: 5556 (Lecture Notes in Computer Science, 5556)

Theory of Computation: Automata, Formal Languages, Computation and Complexity

Mathematical Foundations of Computer Science 2009: 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009, ... (Lecture Notes in Computer Science, 5734)

Formal Languages, Automata and Numeration Systems 2: Applications to Recognizability and Decidability (Iste)

The Nature of Computation

Rudiments of Calculus (Volume 146) (Studies in Logic and the Foundations of Mathematics, Volume 146)

The Foundations of Computability Theory

Computer Science – Theory and Applications: 13th International Computer Science Symposium in Russia, CSR 2018, Moscow, Russia, June 6–10, 2018, ... (Lecture Notes in Computer Science, 10846)