Theory of Semi-Feasible Algorithms [electronic resource] /

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.

Bibliographic Details

Main Authors:	Hemaspaandra, Lane A. author., Torenvliet, Leen. author., SpringerLink (Online service)
Format:	Texto biblioteca
Language:	eng
Published:	Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2003
Subjects:	Computer science., Computer programming., Computers., Algorithms., Computer science, Combinatorics., Computer Science., Programming Techniques., Algorithm Analysis and Problem Complexity., Computation by Abstract Devices., Discrete Mathematics in Computer Science.,
Online Access:	http://dx.doi.org/10.1007/978-3-662-05080-4
Tags:	Add Tag No Tags, Be the first to tag this record!