P-selective sets, and reducing search to decision vs. self-reducibility

Ashish V. Naik, Mitsunori Ogiwara, Alan L. Selman

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

11 Scopus citations

Abstract

We obtain several results that distinguish self-reducibility of a language L with the question of whether search reduces to decision for L. We prove that if NE intersects co-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-reducible. We obtain results that distinguish adaptively randomly self-reducible sets from nonadaptively randomly self-reducible sets, results concerning tradeoffs in multiprover interactive proof systems, and results that distinguish checkable language from those that are nonadaptively checkable. Many of our results depend on new techniques for constructing p-selective sets.

Original languageEnglish (US)
Title of host publicationProceedings of the Eighth Annual Structure in Complexity Theory Conference
Editors Anon
PublisherPubl by IEEE
Pages52-61
Number of pages10
ISBN (Print)0818640715
StatePublished - Jan 1 1993
Externally publishedYes
EventProceedings of the Eighth Annual Structure in Complexity Theory Conference - San Diego, California
Duration: May 18 1993May 21 1993

Publication series

NameProceedings of the Eighth Annual Structure in Complexity Theory Conference

Other

OtherProceedings of the Eighth Annual Structure in Complexity Theory Conference
CitySan Diego, California
Period5/18/935/21/93

ASJC Scopus subject areas

  • Engineering(all)

Cite this