Computability and complexity theory

Resource Information

The work Computability and complexity theory represents a distinct intellectual or artistic creation found in University of Missouri Libraries. This resource is a combination of several types including: Work, Language Material, Books.

Label

Computability and complexity theory

Statement of responsibility

Steven Homer, Alan L. Selman

Creator

• Homer, S., (Steven)

Contributor

• Selman, Alan L

Subject

• Computable functions
• Computational complexity
• Computer science

Language

eng

Summary

• "The theory of computing provides computer science with concepts, models, and formalisms for reasoning about the resources needed to carry out computations and about the efficiency of the computations that use these resources. In addition, it provides tools to measure the difficulty of combinatorial problems both absolutely and in comparison with other problems."
• "Requiring no explicit prerequisite knowledge, Computability and Complexity Theory introduces materials that are the core knowledge in the theory of computation. The book is self-contained, with a preliminary chapter describing key mathematical concepts and notations and subsequent chapters moving from the qualitative aspects of classical computability theory to the quantitative aspects of complexity theory. Dedicated chapters on undecidability NP-completeness and relative computability round of the work, which focuses on the limitations of computability and the distinctions between feasible and intractable."--Jacket
• "The theory of computing provides computer science with concepts, models, and formalisms for reasoning about the resources needed to carry out computations and about the efficiency of the computations that use these resources. In addition, it provides tools to measure the difficulty of combinatorial problems both absolutely and in comparison with other problems." "Requiring no explicit prerequisite knowledge, Computability and Complexity Theory introduces materials that are the core knowledge in the theory of computation. The book is self-contained, with a preliminary chapter describing key mathematical concepts and notations and subsequent chapters moving from the qualitative aspects of classical computability theory to the quantitative aspects of complexity theory. Dedicated chapters on undecidability NP-completeness and relative computability round of the work, which focuses on the limitations of computability and the distinctions between feasible and intractable."--BOOK JACKET

Member of

• Texts in computer science

Cataloging source

DLC

Dewey number

004

Illustrations

illustrations

Index

index present

LC call number

QA76

LC item number

.H6236 2001

Literary form

non fiction

Nature of contents

bibliography

Series statement

Texts in computer science