Selectivity

L. Hemachandra, A. Hoene, Mitsunori Ogihara, A. Selman, T. Thierauf, J. Wang

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

13 Citations (Scopus)

Abstract

A set is P-selective if there is a polynomial-time (p-time) semi-decision algorithm for the set-an algorithm that, given any two strings, decides which is "more likely" to be in the set. This paper studies two natural generalizations of P-selectivity: the NP-selective sets and the sets reducible to P-selective sets via p-time reductions. We show that even NP-selective sets are unlikely to be NP-complete, and we establish a strict hierarchy among the various reductions to P-selective sets.

Original languageEnglish (US)
Title of host publicationProceedings - ICCI 1993
Subtitle of host publication5th International Conference on Computing and Information
EditorsWaldemar W. Koczkodaj, Osman Abou-Rabia, Carl K. Chang
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages55-59
Number of pages5
ISBN (Electronic)0818642122, 9780818642128
DOIs
StatePublished - Jan 1 1993
Externally publishedYes
Event5th International Conference on Computing and Information, ICCI 1993 - Sudbury, Canada
Duration: May 27 1993May 29 1993

Publication series

NameProceedings - ICCI 1993: 5th International Conference on Computing and Information

Conference

Conference5th International Conference on Computing and Information, ICCI 1993
CountryCanada
CitySudbury
Period5/27/935/29/93

Fingerprint

Selectivity
Polynomials
Polynomial time
NP-complete problem
Strings
Likely

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Information Systems
  • Software
  • Modeling and Simulation

Cite this

Hemachandra, L., Hoene, A., Ogihara, M., Selman, A., Thierauf, T., & Wang, J. (1993). Selectivity. In W. W. Koczkodaj, O. Abou-Rabia, & C. K. Chang (Eds.), Proceedings - ICCI 1993: 5th International Conference on Computing and Information (pp. 55-59). [315404] (Proceedings - ICCI 1993: 5th International Conference on Computing and Information). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICCI.1993.315404

Selectivity. / Hemachandra, L.; Hoene, A.; Ogihara, Mitsunori; Selman, A.; Thierauf, T.; Wang, J.

Proceedings - ICCI 1993: 5th International Conference on Computing and Information. ed. / Waldemar W. Koczkodaj; Osman Abou-Rabia; Carl K. Chang. Institute of Electrical and Electronics Engineers Inc., 1993. p. 55-59 315404 (Proceedings - ICCI 1993: 5th International Conference on Computing and Information).

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

Hemachandra, L, Hoene, A, Ogihara, M, Selman, A, Thierauf, T & Wang, J 1993, Selectivity. in WW Koczkodaj, O Abou-Rabia & CK Chang (eds), Proceedings - ICCI 1993: 5th International Conference on Computing and Information., 315404, Proceedings - ICCI 1993: 5th International Conference on Computing and Information, Institute of Electrical and Electronics Engineers Inc., pp. 55-59, 5th International Conference on Computing and Information, ICCI 1993, Sudbury, Canada, 5/27/93. https://doi.org/10.1109/ICCI.1993.315404
Hemachandra L, Hoene A, Ogihara M, Selman A, Thierauf T, Wang J. Selectivity. In Koczkodaj WW, Abou-Rabia O, Chang CK, editors, Proceedings - ICCI 1993: 5th International Conference on Computing and Information. Institute of Electrical and Electronics Engineers Inc. 1993. p. 55-59. 315404. (Proceedings - ICCI 1993: 5th International Conference on Computing and Information). https://doi.org/10.1109/ICCI.1993.315404
Hemachandra, L. ; Hoene, A. ; Ogihara, Mitsunori ; Selman, A. ; Thierauf, T. ; Wang, J. / Selectivity. Proceedings - ICCI 1993: 5th International Conference on Computing and Information. editor / Waldemar W. Koczkodaj ; Osman Abou-Rabia ; Carl K. Chang. Institute of Electrical and Electronics Engineers Inc., 1993. pp. 55-59 (Proceedings - ICCI 1993: 5th International Conference on Computing and Information).
@inproceedings{3225d96a99f2424d97b0b5d053a9ef4d,
title = "Selectivity",
abstract = "A set is P-selective if there is a polynomial-time (p-time) semi-decision algorithm for the set-an algorithm that, given any two strings, decides which is {"}more likely{"} to be in the set. This paper studies two natural generalizations of P-selectivity: the NP-selective sets and the sets reducible to P-selective sets via p-time reductions. We show that even NP-selective sets are unlikely to be NP-complete, and we establish a strict hierarchy among the various reductions to P-selective sets.",
author = "L. Hemachandra and A. Hoene and Mitsunori Ogihara and A. Selman and T. Thierauf and J. Wang",
year = "1993",
month = "1",
day = "1",
doi = "10.1109/ICCI.1993.315404",
language = "English (US)",
series = "Proceedings - ICCI 1993: 5th International Conference on Computing and Information",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "55--59",
editor = "Koczkodaj, {Waldemar W.} and Osman Abou-Rabia and Chang, {Carl K.}",
booktitle = "Proceedings - ICCI 1993",

}

TY - GEN

T1 - Selectivity

AU - Hemachandra, L.

AU - Hoene, A.

AU - Ogihara, Mitsunori

AU - Selman, A.

AU - Thierauf, T.

AU - Wang, J.

PY - 1993/1/1

Y1 - 1993/1/1

N2 - A set is P-selective if there is a polynomial-time (p-time) semi-decision algorithm for the set-an algorithm that, given any two strings, decides which is "more likely" to be in the set. This paper studies two natural generalizations of P-selectivity: the NP-selective sets and the sets reducible to P-selective sets via p-time reductions. We show that even NP-selective sets are unlikely to be NP-complete, and we establish a strict hierarchy among the various reductions to P-selective sets.

AB - A set is P-selective if there is a polynomial-time (p-time) semi-decision algorithm for the set-an algorithm that, given any two strings, decides which is "more likely" to be in the set. This paper studies two natural generalizations of P-selectivity: the NP-selective sets and the sets reducible to P-selective sets via p-time reductions. We show that even NP-selective sets are unlikely to be NP-complete, and we establish a strict hierarchy among the various reductions to P-selective sets.

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

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

U2 - 10.1109/ICCI.1993.315404

DO - 10.1109/ICCI.1993.315404

M3 - Conference contribution

AN - SCOPUS:84919265606

T3 - Proceedings - ICCI 1993: 5th International Conference on Computing and Information

SP - 55

EP - 59

BT - Proceedings - ICCI 1993

A2 - Koczkodaj, Waldemar W.

A2 - Abou-Rabia, Osman

A2 - Chang, Carl K.

PB - Institute of Electrical and Electronics Engineers Inc.

ER -