P-Selective Sets, and Reducing Search to Decision vs. Self-Reducibility (1993)
| Citations: | 35 - 9 self |
BibTeX
@MISC{Hemaspaandra93p-selectivesets,,
author = {Edith Hemaspaandra and Ashish V. Naik and Mitsunori Ogiwara and Alan L. Selman},
title = {P-Selective Sets, and Reducing Search to Decision vs. Self-Reducibility},
year = {1993}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We obtain several results that distinguish self-reducibility of a language L with the question of whether search reduces to decision for L. These include: (i) If NE 6= E, then there exists a set L in NP \Gamma P such that search reduces to decision for L, search does not nonadaptively reduces to decision for L, and L is not self-reducible. Funding for this research was provided by the National Science Foundation under grant CCR9002292. y Department of Computer Science, State University of New York at Buffalo, 226 Bell Hall, Buffalo, NY 14260 z Department of Computer Science, State University of New York at Buffalo, 226 Bell Hall, Buffalo, NY 14260 x Research performed while visiting the Department of Computer Science, State University of New York at Buffalo, Jan. 1992--Dec. 1992. Current address: Department of Computer Science, University of Electro-Communications, Chofu-shi, Tokyo 182, Japan. -- Department of Computer Science, State University of New York at Buffalo, 226...
