Towards a Predictive Computational Complexity Theory

Madhav V. Marathe

Abstract: Over the last three decades, language recognition models of computation and associated resource bounded reductions have played a central role in characterizing the computational complexity of combinatorial problems. However, due to their generality, these concepts have inherent limitations - they typically ignore the underlying structure and semantics of the problem instances. Thus they are generally not “robust” in terms of simultaneously classifying variants of the original problem.

External IDs:dblp:conf/icalp/Marathe02