Theory of Semi-Feasible Algorithms /

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...

Full description

Bibliographic Details

Main Author:	Hemaspaandra, Lane A.
Corporate Author:	SpringerLink (Online service)
Other Authors:	Torenvliet, Leen
Format:	eBook
Language:	English
Published:	Berlin, Heidelberg : Springer Berlin Heidelberg, 2003.
Series:	Monographs in Theoretical Computer Science An EATCS Series.
Subjects:	Computer science. Computer software. Computational complexity. Algorithms. Combinatorial analysis. Electronic books.
Online Access:	Connect to the full text of this electronic book