This book presents a consolidated survey of the vibrant field of research known as the theory of semifeasible algorithms. This research stream perfectly showcases the richness of, and contrasts between, the central notions of complexity: running time, nonuniform complexity, lowness, and NPhardness. Research into semifeasible computation has already developed a rich set of tools, yet is young enough to have an abundance of fresh, open issues.
This book presents a consolidated survey of the vibrant field of research known as the theory of semifeasible algorithms. This research stream perfectly showcases the richness of, and contrasts between, the central notions of complexity: running time, nonuniform complexity, lowness, and NPhardness. Research into semifeasible computation has already developed a rich set of tools, yet is young enough to have an abundance of fresh, open issues. Being essentially selfcontained, 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.
