Sparse P-hard sets yield space-efficient algorithms

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

9 Citations (Scopus)

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)
Title of host publicationAnnual Symposium on Foundations of Computer Science - Proceedings
Editors Anon
PublisherIEEE
Pages354-361
Number of pages8
StatePublished - 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

Other

OtherProceedings of the 1995 IEEE 36th Annual Symposium on Foundations of Computer Science
CityMilwaukee, WI, USA
Period10/23/9510/25/95

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

Ogihara, M. (1995). Sparse P-hard sets yield space-efficient algorithms. In Anon (Ed.), Annual Symposium on Foundations of Computer Science - Proceedings (pp. 354-361). IEEE.

Sparse P-hard sets yield space-efficient algorithms. / Ogihara, Mitsunori.

Annual Symposium on Foundations of Computer Science - Proceedings. ed. / Anon. IEEE, 1995. p. 354-361.

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

Ogihara, M 1995, Sparse P-hard sets yield space-efficient algorithms. in Anon (ed.), Annual Symposium on Foundations of Computer Science - Proceedings. IEEE, pp. 354-361, Proceedings of the 1995 IEEE 36th Annual Symposium on Foundations of Computer Science, Milwaukee, WI, USA, 10/23/95.
Ogihara M. Sparse P-hard sets yield space-efficient algorithms. In Anon, editor, Annual Symposium on Foundations of Computer Science - Proceedings. IEEE. 1995. p. 354-361
Ogihara, Mitsunori. / Sparse P-hard sets yield space-efficient algorithms. Annual Symposium on Foundations of Computer Science - Proceedings. editor / Anon. IEEE, 1995. pp. 354-361
@inproceedings{63ddfbf82df84110b66345f6d6d00a9b,
title = "Sparse P-hard sets yield space-efficient algorithms",
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].",
author = "Mitsunori Ogihara",
year = "1995",
language = "English (US)",
pages = "354--361",
editor = "Anon",
booktitle = "Annual Symposium on Foundations of Computer Science - Proceedings",
publisher = "IEEE",

}

TY - GEN

T1 - Sparse P-hard sets yield space-efficient algorithms

AU - Ogihara, Mitsunori

PY - 1995

Y1 - 1995

N2 - 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].

AB - 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].

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

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

M3 - Conference contribution

SP - 354

EP - 361

BT - Annual Symposium on Foundations of Computer Science - Proceedings

A2 - Anon, null

PB - IEEE

ER -