arXiv Open Access 2010

nested PLS

Toshiyasu Arai
Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

Penulis (1)

T

Toshiyasu Arai

Format Sitasi

Arai, T. (2010). nested PLS. https://arxiv.org/abs/1005.2005

Akses Cepat

Lihat di Sumber
Informasi Jurnal
Tahun Terbit
2010
Bahasa
en
Sumber Database
arXiv
Akses
Open Access ✓