Theory of semi-feasible algorithms / Lane A. Hemaspaandra, Leen Torenvliet.

Format:

Book

Author/Creator:

Hemaspaandra, Lane A.

Contributor:

Torenvliet, Leen.

Class of 1924 Book Fund.

Series:

Monographs in theoretical computer science

Language:

English

Subjects (All):

Computer algorithms.

Computational complexity.

Physical Description:

x, 148 pages : illustrations ; 25 cm.

Place of Publication:

Berlin ; New York : Springer, [2003]

Summary:

This book presents a consolidated survey of the vibrant field of research known as the theory of semi-feasible algorithms. This research stream perfectly showcases the richness of, and contrasts between, the central notions of complexity: running time, nonuniform complexity, lowness, and NP-hardness. Research into semi-feasible computation has already developed a rich set of tools, yet is young enough to have an abundance of fresh, open issues.

Being essentially self-contained, the book requires neither great mathematical maturity nor an extensive background in computational complexity theory or in computer science in general. Newcomers are introduced to the field systematically and guided to the frontiers of current research. Researchers already active in the field will appreciate the book as a valuable source of reference.

Notes:

Includes bibliographical references (pages [125]-131) and index.

Local Notes:

Acquired for the Penn Libraries with assistance from the Class of 1924 Book Fund.

ISBN:

3540422005

OCLC:

49353009