文章基本信息

标题：The Relative Complexity of Local Search Heuristics and the Iteration Principle
本地全文：下载
作者：Tsuyoshi Morioka
期刊名称：Electronic Colloquium on Computational Complexity
印刷版ISSN：1433-8092
出版年度：2003
卷号：2003
出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
摘要：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.
关键词：PLS , Polynomial Local Search , Total Search Problems , Type-2 Computation