Reductions on NP and P-selective sets |
| |
Authors: | Alan L Selman |
| |
Affiliation: | Computer Science Department, Iowa State University, Ames, IA 50011, U.S.A. |
| |
Abstract: | P-selective sets are used to distinguish polynomial time-bounded reducibilities on NP. In particular, we consider different kinds of “positive” reductions; these preserve membership in NP and are not a priori closed under complements. We show that the class of all sets which are both P-selective and have positive reductions to their complements is P. This is used to show that if DEXT ≠ NEXT, then there exists a set in NP?P that is not positive reducible to its complement. Various similar results are obtained. We also show that P is the class of all sets which are both p-selective and positive truth-table self-reducible. From this result, it follows that various naturally defined apparently intractible problems are not p-selective unless P = NP. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|