On one query, self-reducible sets

Mitsunori Ogiwara, Antoni Lozano

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Scopus citations

Abstract

The authors study one-word-decreasing self-reducible sets, which are the usual self-reducible sets with the peculiarity that the self-reducibility machine makes at most one query to a word lexicographically smaller than the input. It is first shown that for all counting classes defined by a predicate on the number of accepting paths there exist complete sets which are one-word-decreasing self-reducible. Using this fact it is proved that, for any class K chosen from a certain set of complexity classes, it holds that (1) if there is a sparse polynomial-time bounded-truth-table-hard set for K, then K = P, and (2) if there is a sparse strongly nondeterministic bounded-truth-table-hard set for K, then K ⊂ NP 23 co-NP. The main result also shows that the same facts hold for the class PSPACE.

Original languageEnglish (US)
Title of host publicationProc 6 Annu Struct Complexity Theor
PublisherPubl by IEEE
Pages139-151
Number of pages13
ISBN (Print)0818622555
StatePublished - Dec 1 1991
EventProceedings of the 6th Annual Structure in Complexity Theory Conference - Chicago, IL, USA
Duration: Jun 30 1991Jul 3 1991

Publication series

NameProc 6 Annu Struct Complexity Theor

Other

OtherProceedings of the 6th Annual Structure in Complexity Theory Conference
CityChicago, IL, USA
Period6/30/917/3/91

    Fingerprint

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Ogiwara, M., & Lozano, A. (1991). On one query, self-reducible sets. In Proc 6 Annu Struct Complexity Theor (pp. 139-151). (Proc 6 Annu Struct Complexity Theor). Publ by IEEE.