Corrigendum: Space-Bounded Reducibility among Combinatorial Problems

Reducibility Among Combinatorial Problems

Structural Parameterized Complexity

We revisit fixed-parameter tractability, fixed-parameter reducibility and kernelizability. The standard formulations of their definitions are enhanced for greater correctness from a structural complexity point of view. Doing so makes clear the distinction between fixed-parameter reducibility and kernelizability. Additionally, these time based definitions are augmented with space based counterpa...

Strongly Bounded Turing Reducibilities and Computably Enumerable Sets

Preface In this course we survey some recent work on the strongly bounded Turing re-ducibilities on the computably enumerable sets. Bounded Turing reducibilities are obtained from classical Turing reducibility by imposing upper bounds on the use functions (i.e., on the size of the oracle queries) of the reductions. The most popular bounded Turing reducibility which has been intensively studied ...

Width-Bounded Reducibility and Binary Search over Complexity Classes

We introduce a notion of width-bounded reducibility. Width-bounded reducibility provides a circuit-based realization of RuzzoSimon-Tompa reducibility [RS-84], and allows us to generalize that notion of reducibility. We show that reductions of simultaneously restricted width and depth provide a characterization of binary search over complexity classes, as introduced by Wagner [Wa-89] and Buss an...

On Self-Reducibility and Reoptimization of Closest Substring Problem

In this paper, we define the reoptimization variant of the closest substring problem (CSP) under sequence addition. We show that, even with the additional information we have about the problem instance, the problem of finding a closest substring is still NP-hard. We investigate the combinatorial property of optimization problems called self-reducibility. We show that problems that are polynomia...