Computability and Complexity Theory

This book surveys theoretical computer science, presenting fundamental concepts and results. Updated and revised, the new edition includes two new chapters on nonuniform complexity, circuit complexity and parallel complexity, and randomized complexity.

Saved in:
Bibliographic Details
Main Authors Homer, Steven, Selman, Alan L
Format eBook Book
LanguageEnglish
Published New York Springer Nature 2011
Springer
Springer US
Edition2
SeriesTexts in Computer Science
Subjects
Algorithm Analysis and Problem Complexity
Computable functions
Computational complexity
Computer Science
Data processing Computer science
Theory of Computation
Online AccessGet full text
ISBN146140682X
9781461406822
1461406811
9781461406815
9781489989710
1489989714
ISSN1868-0941
1868-095X
DOI10.1007/978-1-4614-0682-2

Cover

More Information
Summary:This book surveys theoretical computer science, presenting fundamental concepts and results. Updated and revised, the new edition includes two new chapters on nonuniform complexity, circuit complexity and parallel complexity, and randomized complexity.
Bibliography:Includes bibliographical references and indexes
ISBN:146140682X
9781461406822
1461406811
9781461406815
9781489989710
1489989714
ISSN:1868-0941
1868-095X
DOI:10.1007/978-1-4614-0682-2