Sparse P-hard sets yield space-efficient algorithms

Research output: Contribution to journalConference articlepeer-review

9 Scopus citations

Abstract

Hartmanis conjectured that there exist no sparse complete sets for P under logspace many-one reductions. In this paper, in support of the conjecture, it is shown that if P has sparse hard sets under logspace many-one reductions, then P is contained as a subset within DSPACE[log2 n]. The result follows from a more general statement: if P has 2polylog sparse hard sets under poly-logarithmic space-computable many-one reductions, then P is contained as a subset within DSPACE[polylog].

Original languageEnglish (US)
Pages (from-to)354-361
Number of pages8
JournalAnnual Symposium on Foundations of Computer Science - Proceedings
StatePublished - Dec 1 1995
Externally publishedYes
EventProceedings of the 1995 IEEE 36th Annual Symposium on Foundations of Computer Science - Milwaukee, WI, USA
Duration: Oct 23 1995Oct 25 1995

ASJC Scopus subject areas

  • Hardware and Architecture

Fingerprint Dive into the research topics of 'Sparse P-hard sets yield space-efficient algorithms'. Together they form a unique fingerprint.

Cite this