ENGLISH

Theory of Semi-Feasible Algorithms

By Lane A. Hemaspaandra , Leen Torenvliet

Book information

Publisher
Springer
Year
2003
ISBN
978-3-642-07581-0, 978-3-662-05080-4
DOI
10.1007/978-3-662-05080-4
Language
english
Format
PDF
Filesize
7 MB (6976873 bytes)
Series
Monographs in Theoretical Computer Science. An EATCS Series
Pages
155\155
Orientation
portrait
Paginated
no
Scanned
yes
Time added
2013-08-01 04:00:00
Algorithm Analysis and Problem Complexity; Computa

Description

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.

Similar books