We distinguish self-reducibility of a language L with the question of whether search reduces to decision for L. Results include: (i) If NE{E, then there exists a set L in NP&P such that search reduces to decision for L, search does not nonadaptively reduce to decision for L and L is not self-reducib
β¦ LIBER β¦
P-Selective Self-Reducible Sets: A New Characterization of P
β Scribed by Harry Buhrman; Leen Torenvliet
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 361 KB
- Volume
- 53
- Category
- Article
- ISSN
- 0022-0000
No coin nor oath required. For personal study only.
β¦ Synopsis
We show that any p-selective and self-reducible set is in P. As the converse is also true, we obtain a new characterization of the class P. A generalization and several consequences of this theorem are discussed. Among other consequences, we show that under reasonable assumptions auto-reducibility and self-reducibility differ on NP, and that there are non-p-T-mitotic sets in NP.
π SIMILAR VOLUMES
P-Selective Sets and Reducing Search to
β
Edith Hemaspaandra; Ashish V. Naik; Mitsunori Ogihara; Alan L. Selman
π
Article
π
1996
π
Elsevier Science
π
English
β 684 KB
On polynomial-time truth-table reducibil
β
Seinosuke Toda
π
Article
π
1991
π
Springer
π
English
β 739 KB
Reductibility classes of P-selective set
β
Lane A. Hemaspaandra; Albrecht Hoene; Mitsunori Ogihara
π
Article
π
1996
π
Elsevier Science
π
English
β 807 KB
P-selective sets, tally languages, and t
β
Alan L. Selman
π
Article
π
1979
π
Springer
π
English
β 677 KB
A characterization of semilinear sets
β
L.Y. Liu; P. Weiner
π
Article
π
1970
π
Elsevier Science
π
English
β 372 KB
In this report, the class of semilinear sets is shown to be the least class of sets which contains all of the stratified semilinear sets and is closed under finite intersection.
A New Characterization of NP, P, and PSP
β
Florin Manea; Maurice Margenstern; Victor Mitrana; Mario J. PΓ©rez-JimΓ©nez
π
Article
π
2008
π
Springer
π
English
β 425 KB