Graph explorer

nested PLS

In this note we will introduce a class of search problems, called nested Polynomial Local Search (nPLS) problems, and show that definable NP search problems, i.e., $Σ^b_1$-definable functions in $T^2_2$ are characterized in terms of the nested PLS.

3 nodes2 linksoverview mapnested PLS
3 nodes2 links
nested PLS3 visible / 3 total nodes / 2 links
AuthorshipTopic signalWnested PLSpreprint / 2010AToshiyasu AraiResearcherTmath.LO1661 works
PaperSignal 102 links

nested PLS

preprint / 2010

Open