nested PLS
classification
🧮 math.LO
keywords
nestedproblemssearchdefinablecalledcharacterizedclassfunctions
read the original abstract
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., $\Sigma^b_1$-definable functions in $T^2_2$ are characterized in terms of the nested PLS.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.