How hard are sparse sets?

Lane A. Hemachandra, Mitsunori Ogihara, Osamu Watanabe

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

26 Citations (Scopus)

Abstract

The frontier of knowledge about the structural properties of sparse sets is explored. A collection of topics that are related to the issue of how hard or easy sparse sets is surveyed. The strongest currently known results, together with the open problems that the results leave, are presented.

Original languageEnglish (US)
Title of host publicationProceedings of the Seventh Annual Structure in Complexity Theory Conference
PublisherPubl by ERROR: no PUB record found for PX none CN nonpie IG 75516
Pages222-238
Number of pages17
ISBN (Print)081862955X
StatePublished - 1992
Externally publishedYes
EventProceedings of the Seventh Annual Structure in Complexity Theory Conference - Boston, MA, USA
Duration: Jun 22 1992Jun 25 1992

Other

OtherProceedings of the Seventh Annual Structure in Complexity Theory Conference
CityBoston, MA, USA
Period6/22/926/25/92

Fingerprint

Structural properties

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Hemachandra, L. A., Ogihara, M., & Watanabe, O. (1992). How hard are sparse sets? In Proceedings of the Seventh Annual Structure in Complexity Theory Conference (pp. 222-238). Publ by ERROR: no PUB record found for PX none CN nonpie IG 75516.

How hard are sparse sets? / Hemachandra, Lane A.; Ogihara, Mitsunori; Watanabe, Osamu.

Proceedings of the Seventh Annual Structure in Complexity Theory Conference. Publ by ERROR: no PUB record found for PX none CN nonpie IG 75516, 1992. p. 222-238.

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

Hemachandra, LA, Ogihara, M & Watanabe, O 1992, How hard are sparse sets? in Proceedings of the Seventh Annual Structure in Complexity Theory Conference. Publ by ERROR: no PUB record found for PX none CN nonpie IG 75516, pp. 222-238, Proceedings of the Seventh Annual Structure in Complexity Theory Conference, Boston, MA, USA, 6/22/92.
Hemachandra LA, Ogihara M, Watanabe O. How hard are sparse sets? In Proceedings of the Seventh Annual Structure in Complexity Theory Conference. Publ by ERROR: no PUB record found for PX none CN nonpie IG 75516. 1992. p. 222-238
Hemachandra, Lane A. ; Ogihara, Mitsunori ; Watanabe, Osamu. / How hard are sparse sets?. Proceedings of the Seventh Annual Structure in Complexity Theory Conference. Publ by ERROR: no PUB record found for PX none CN nonpie IG 75516, 1992. pp. 222-238
@inproceedings{762372a07e254ea4a27e6a33a10d87ff,
title = "How hard are sparse sets?",
abstract = "The frontier of knowledge about the structural properties of sparse sets is explored. A collection of topics that are related to the issue of how hard or easy sparse sets is surveyed. The strongest currently known results, together with the open problems that the results leave, are presented.",
author = "Hemachandra, {Lane A.} and Mitsunori Ogihara and Osamu Watanabe",
year = "1992",
language = "English (US)",
isbn = "081862955X",
pages = "222--238",
booktitle = "Proceedings of the Seventh Annual Structure in Complexity Theory Conference",
publisher = "Publ by ERROR: no PUB record found for PX none CN nonpie IG 75516",

}

TY - GEN

T1 - How hard are sparse sets?

AU - Hemachandra, Lane A.

AU - Ogihara, Mitsunori

AU - Watanabe, Osamu

PY - 1992

Y1 - 1992

N2 - The frontier of knowledge about the structural properties of sparse sets is explored. A collection of topics that are related to the issue of how hard or easy sparse sets is surveyed. The strongest currently known results, together with the open problems that the results leave, are presented.

AB - The frontier of knowledge about the structural properties of sparse sets is explored. A collection of topics that are related to the issue of how hard or easy sparse sets is surveyed. The strongest currently known results, together with the open problems that the results leave, are presented.

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

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

M3 - Conference contribution

SN - 081862955X

SP - 222

EP - 238

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

PB - Publ by ERROR: no PUB record found for PX none CN nonpie IG 75516

ER -