Theory of Semi-Feasible Algorithms

Theory of Semi-Feasible Algorithms

by Lane A. Hemaspaandra

Part of Monographs in Theoretical Computer Science An EATCS Series

Browse books you can read free on Readfeed

No club is reading this yet — be the first to start one

Start a club free
About
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.

Discuss Theory of Semi-Feasible Algorithms with other readers

Join or start a book club for Theory of Semi-Feasible Algorithms on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.

Frequently asked questions

How do I join a book club for Theory of Semi-Feasible Algorithms?

Sign up free on Readfeed, then browse public clubs or start your own club with Theory of Semi-Feasible Algorithms as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.

Can I discuss Theory of Semi-Feasible Algorithms with other readers online?

Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Theory of Semi-Feasible Algorithms with readers worldwide — whether your club is virtual, in-person, or hybrid.

Is Readfeed free?

Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.