On one query, self-reducible sets

Mitsunori Ogihara, Antoni Lozano

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

9 Citations (Scopus)

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 - 1991
Externally publishedYes
EventProceedings of the 6th Annual Structure in Complexity Theory Conference - Chicago, IL, USA
Duration: Jun 30 1991Jul 3 1991

Other

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

Fingerprint

Polynomials

ASJC Scopus subject areas

  • Engineering(all)

Cite this

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

On one query, self-reducible sets. / Ogihara, Mitsunori; Lozano, Antoni.

Proc 6 Annu Struct Complexity Theor. Publ by IEEE, 1991. p. 139-151.

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

Ogihara, M & Lozano, A 1991, On one query, self-reducible sets. in Proc 6 Annu Struct Complexity Theor. Publ by IEEE, pp. 139-151, Proceedings of the 6th Annual Structure in Complexity Theory Conference, Chicago, IL, USA, 6/30/91.
Ogihara M, Lozano A. On one query, self-reducible sets. In Proc 6 Annu Struct Complexity Theor. Publ by IEEE. 1991. p. 139-151
Ogihara, Mitsunori ; Lozano, Antoni. / On one query, self-reducible sets. Proc 6 Annu Struct Complexity Theor. Publ by IEEE, 1991. pp. 139-151
@inproceedings{79497e7f66bd4341884ac8998007f7df,
title = "On one query, self-reducible sets",
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.",
author = "Mitsunori Ogihara and Antoni Lozano",
year = "1991",
language = "English (US)",
isbn = "0818622555",
pages = "139--151",
booktitle = "Proc 6 Annu Struct Complexity Theor",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - On one query, self-reducible sets

AU - Ogihara, Mitsunori

AU - Lozano, Antoni

PY - 1991

Y1 - 1991

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0026398367&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026398367&partnerID=8YFLogxK

M3 - Conference contribution

SN - 0818622555

SP - 139

EP - 151

BT - Proc 6 Annu Struct Complexity Theor

PB - Publ by IEEE

ER -