Classification of Search Problems and Their Definability in Bounded Arithmetic (2001)
by
Tsuyoshi Morioka
| Citations: | 3 - 2 self |
BibTeX
@MISC{Morioka01classificationof,
author = {Tsuyoshi Morioka},
title = {Classification of Search Problems and Their Definability in Bounded Arithmetic},
year = {2001}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present a new framework for the study of search problems and their definability in bounded arithmetic. We identify two notions of complexity of search problems: verification complexity and computational complexity. Notions of exact solvability and exact reducibility are developed, and exact b i -definability of search problems in bounded arithmetic is introduced. We specify a new machine model called the oblivious witness-oracle Turing machines. Based on
