Theory of Computation (Texts in Computer Science) - Image 1

Price loading...

Springer Theory of Computation (Texts in Computer Science)

Name: Theory of Computation (Texts in Computer Science)
Brand: Springer

Algorithms

Price History & Forecast

No Price Data Available

Price history will appear here once data is collected from Amazon.

Price Distribution

No price data available for histogram

Description

This textbook is uniquely written with dual purpose. It covers core material in the foundations of computing for graduate students in computer science and also provides an introduction to some more advanced topics for those intending further study in the area. The book contains an invaluable collection of lectures for first-year graduates on the theory of computation, focusing primarily on computational complexity theory. It also deals with the classification of computational problems in terms of their inherent complexity. It incorporates rigorous treatment of computational models, such as deterministic, nondeterministic, and alternating Turing machines; circuits; probabilistic machines; interactive proof systems; automata on infinite objects; and logical formalisms. Features include more than 40 lectures for first year graduate students, and a dozen homework sets and exercises. The book is aimed at advanced undergraduates and first-year graduates in Computer Science or Mathematics.

Product Specifications

Brand: Springer
Format: paperback
ASIN: 1849965714
Category: Books > Subjects > Computing & Internet > Programming > Algorithms
Domain: Amazon UK
Release Date: 21 October 2010
Listed Since: 01 October 2010

Barcode

No barcode data available

Springer Theory of Computation (Texts in Computer Science)

Price History & Forecast

No Price Data Available

Price Distribution

Description

Product Specifications

Barcode

Similar Products You Might Like

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

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

Theory of Computation

Automata and Computability

Theory of Computational Complexity (Wiley Series in Discrete Mathematics and Optimization)

Automata and Computability (Undergraduate Texts in Computer Science)

Introduction to the Theory of Computation

The Foundations of Computability Theory

Computability and Complexity: Foundations and Tools for Pursuing Scientific Applications (Undergraduate Topics in Computer Science)

Computational Complexity: A Modern Approach

Computational Complexity: A Conceptual Perspective

The Complexity Theory Companion (Texts in Theoretical Computer Science. An EATCS Series)

Understanding Computation: Pillars, Paradigms, Principles (Texts in Computer Science)

Set Theory for Computing: From Decision Procedures to Declarative Programming with Sets (Monographs in Computer Science)

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

Mathematical Foundations of Computer Science

Computability Theory: An Introduction to Recursion Theory

Verification of Sequential and Concurrent Programs (Texts in Computer Science)

Understanding Computation: Pillars, Paradigms, Principles (Texts in Computer Science)

Models of Computation (Texts in Theoretical Computer Science. An EATCS Series)

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Computability

A Programming Approach to Computability (Monographs in Computer Science)

Boolean Functions and Computation Models (Texts in Theoretical Computer Science. An EATCS Series)