ACM SIGACT News
Some connections between bounded query classes and non-uniform complexity
Information and Computation
One query reducibilities between partial information classes
Theoretical Computer Science - Mathematical foundations of computer science 2004
Open questions in the theory of semifeasible computation
ACM SIGACT News
Languages to diagonalize against advice classes
Computational Complexity
Separating NE from Some Nonuniform Nondeterministic Complexity Classes
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Choosing, agreeing, and eliminating in communication complexity
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Separating NE from some nonuniform nondeterministic complexity classes
Journal of Combinatorial Optimization
Sparse selfreducible sets and polynomial size circuit lower bounds
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
P-Selectivity, immunity, and the power of one bit
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Combining self-reducibility and partial information algorithms
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Survey: The consequences of eliminating NP solutions
Computer Science Review
Choosing, Agreeing, and Eliminating in Communication Complexity
Computational Complexity
| Hi-index | 0.00 |
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.