Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR03-051 | 20th June 2003 00:00

The Relative Complexity of Local Search Heuristics and the Iteration Principle

RSS-Feed




TR03-051
Authors: Tsuyoshi Morioka
Publication: 30th June 2003 18:14
Downloads: 1266
Keywords: 


Abstract:

Johnson, Papadimitriou and Yannakakis introduce the class $\PLS$
consisting of optimization problems for which efficient local-
search heuristics exist. We formulate a type-2 problem $\iter$
that characterizes $\PLS$ in style of Beame et al., and prove
a criterion for type-2 problems to be nonreducible to $\iter$.
As a corollary, we obtain the first relative separation of $\PLS$
from Papadimitriou's classes $\PPA$, $\PPAD$, $\PPADS$, and
$\PPP$. Based on the criterion, we derive a special case of Riis's
\emph{independence criterion} for the Bounded Arithmetic theory
$S^2_2(L)$. We also prove that $\PLS$ is closed under Turing
reducibility.



ISSN 1433-8092 | Imprint