Polynomial-time membership comparable sets

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

14 Citations (Scopus)

Abstract

This paper introduces and studies a notion called polynomial-time membership comparable sets, which is a generalization of P-selective sets. For a function g, a set A is called polynomial-time g-membership comparable if there is a polynomial-time computable function f such that for any x1,···,xm with m≥g(max{|x1|, ···,|xm|}), outputs bqq{0,1}m such that (A(x1),···, A(xm))≠b. It is shown for each C chosen from {PSPACE,UP,FewP,NP,C=PP,MOD2P,MOD3P,· ··}, that if all of C are polynomial-time c(log n)-membership comparable for some fixed constant cc-truth-table reducible to some P-selective sets, then C = P, which resolves a question that has been left open for a long time.

Original languageEnglish (US)
Title of host publicationProceedings of the IEEE Annual Structure in Complexity Theory Conference
Editors Anon
PublisherPubl by IEEE
Pages2-11
Number of pages10
ISBN (Print)0818656727
StatePublished - 1994
Externally publishedYes
EventProceedings of the 9th Annual Structure in Complexity Theory Conference - Amsterdam, Neth
Duration: Jun 28 1994Jul 1 1994

Other

OtherProceedings of the 9th Annual Structure in Complexity Theory Conference
CityAmsterdam, Neth
Period6/28/947/1/94

Fingerprint

Polynomials

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Ogihara, M. (1994). Polynomial-time membership comparable sets. In Anon (Ed.), Proceedings of the IEEE Annual Structure in Complexity Theory Conference (pp. 2-11). Publ by IEEE.

Polynomial-time membership comparable sets. / Ogihara, Mitsunori.

Proceedings of the IEEE Annual Structure in Complexity Theory Conference. ed. / Anon. Publ by IEEE, 1994. p. 2-11.

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

Ogihara, M 1994, Polynomial-time membership comparable sets. in Anon (ed.), Proceedings of the IEEE Annual Structure in Complexity Theory Conference. Publ by IEEE, pp. 2-11, Proceedings of the 9th Annual Structure in Complexity Theory Conference, Amsterdam, Neth, 6/28/94.
Ogihara M. Polynomial-time membership comparable sets. In Anon, editor, Proceedings of the IEEE Annual Structure in Complexity Theory Conference. Publ by IEEE. 1994. p. 2-11
Ogihara, Mitsunori. / Polynomial-time membership comparable sets. Proceedings of the IEEE Annual Structure in Complexity Theory Conference. editor / Anon. Publ by IEEE, 1994. pp. 2-11
@inproceedings{7c034f92ea0243a3bb899428218c4870,
title = "Polynomial-time membership comparable sets",
abstract = "This paper introduces and studies a notion called polynomial-time membership comparable sets, which is a generalization of P-selective sets. For a function g, a set A is called polynomial-time g-membership comparable if there is a polynomial-time computable function f such that for any x1,···,xm with m≥g(max{|x1|, ···,|xm|}), outputs bqq{0,1}m such that (A(x1),···, A(xm))≠b. It is shown for each C chosen from {PSPACE,UP,FewP,NP,C=PP,MOD2P,MOD3P,· ··}, that if all of C are polynomial-time c(log n)-membership comparable for some fixed constant cc-truth-table reducible to some P-selective sets, then C = P, which resolves a question that has been left open for a long time.",
author = "Mitsunori Ogihara",
year = "1994",
language = "English (US)",
isbn = "0818656727",
pages = "2--11",
editor = "Anon",
booktitle = "Proceedings of the IEEE Annual Structure in Complexity Theory Conference",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - Polynomial-time membership comparable sets

AU - Ogihara, Mitsunori

PY - 1994

Y1 - 1994

N2 - This paper introduces and studies a notion called polynomial-time membership comparable sets, which is a generalization of P-selective sets. For a function g, a set A is called polynomial-time g-membership comparable if there is a polynomial-time computable function f such that for any x1,···,xm with m≥g(max{|x1|, ···,|xm|}), outputs bqq{0,1}m such that (A(x1),···, A(xm))≠b. It is shown for each C chosen from {PSPACE,UP,FewP,NP,C=PP,MOD2P,MOD3P,· ··}, that if all of C are polynomial-time c(log n)-membership comparable for some fixed constant cc-truth-table reducible to some P-selective sets, then C = P, which resolves a question that has been left open for a long time.

AB - This paper introduces and studies a notion called polynomial-time membership comparable sets, which is a generalization of P-selective sets. For a function g, a set A is called polynomial-time g-membership comparable if there is a polynomial-time computable function f such that for any x1,···,xm with m≥g(max{|x1|, ···,|xm|}), outputs bqq{0,1}m such that (A(x1),···, A(xm))≠b. It is shown for each C chosen from {PSPACE,UP,FewP,NP,C=PP,MOD2P,MOD3P,· ··}, that if all of C are polynomial-time c(log n)-membership comparable for some fixed constant cc-truth-table reducible to some P-selective sets, then C = P, which resolves a question that has been left open for a long time.

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

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

M3 - Conference contribution

SN - 0818656727

SP - 2

EP - 11

BT - Proceedings of the IEEE Annual Structure in Complexity Theory Conference

A2 - Anon, null

PB - Publ by IEEE

ER -