Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
On total functions, existence theorems and computational complexity
Theoretical Computer Science
On the complexity of the parity argument and other inefficient proofs of existence
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
| Hi-index | 0.00 |
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.