How hard are sparse sets?

Lane A. Hemachandra, Mitsunori Ogiwara, Osamu Watanabe

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

27 Scopus citations

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 - Dec 1 1992
Externally publishedYes
EventProceedings of the Seventh Annual Structure in Complexity Theory Conference - Boston, MA, USA
Duration: Jun 22 1992Jun 25 1992

Publication series

NameProceedings of the Seventh Annual Structure in Complexity Theory Conference

Other

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

    Fingerprint

ASJC Scopus subject areas

  • Engineering(all)

Cite this

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