From the Publisher:
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.
Cited By
- Buhrman H, Torenvliet L, Unger F and Vereshchagin N (2019). Sparse Selfreducible Sets and Nonuniform Lower Bounds, Algorithmica, 81:1, (179-200), Online publication date: 1-Jan-2019.
- Hemaspaandra L (2014). Beautiful structures, ACM SIGACT News, 45:3, (54-70), Online publication date: 17-Sep-2014.
- Beimel A, Daniel S, Kushilevitz E and Weinreb E Choosing, agreeing, and eliminating in communication complexity Proceedings of the 37th international colloquium conference on Automata, languages and programming, (451-462)
- Fu B, Li A and Zhang L Separating NE from Some Nonuniform Nondeterministic Complexity Classes Proceedings of the 15th Annual International Conference on Computing and Combinatorics, (486-495)
- Faliszewski P and Hemaspaandra L (2006). Open questions in the theory of semifeasible computation, ACM SIGACT News, 37:1, (47-65), Online publication date: 1-Mar-2006.
- Hemaspaandra L and Torenvliet L P-Selectivity, immunity, and the power of one bit Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science, (323-331)
- Buhrman H, Torenvliet L and Unger F Sparse selfreducible sets and polynomial size circuit lower bounds Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science, (455-468)
- Pollett C (2006). Languages to diagonalize against advice classes, Computational Complexity, 14:4, (341-361), Online publication date: 1-Mar-2006.
- Bab S and Nickelsen A (2005). One query reducibilities between partial information classes, Theoretical Computer Science, 345:2-3, (173-189), Online publication date: 22-Nov-2005.
- Nickelsen A and Tantau T (2003). Partial information classes, ACM SIGACT News, 34:1, (32-46), Online publication date: 1-Mar-2003.
- (2001). The Communication Complexity of Enumeration, Elimination, and Selection, Journal of Computer and System Sciences, 63:2, (148-185), Online publication date: 1-Sep-2001.
Index Terms
- Theory of Semi-Feasible Algorithms