SL is contained as a subset within L4/3

Roy Armoni; Amnon Ta-Shma; Avi Wigderson; Shiyu Zhou

SL is contained as a subset within L^4/3

Roy Armoni^*
, Amnon Ta-Shma
, Avi Wigderson
, Shiyu Zhou

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Contribution to journal › Conference article › peer-review

20 Scopus citations

Abstract

We present a deterministic algorithm that computes st-connectivity in undirected graphs using O(log^4/3n) space. This improves the previous O(log^3/2n) bound of Nisan, Szemeredi and Wigderson [NSW92].

Original language	English
Pages (from-to)	230-239
Number of pages	10
Journal	Conference Proceedings of the Annual ACM Symposium on Theory of Computing
State	Published - 1997
Event	Proceedings of the 1997 29th Annual ACM Symposium on Theory of Computing - El Paso, TX, USA Duration: 4 May 1997 → 6 May 1997

Cite this

@article{c3103136d1c540098ee4491b46efae7b,

title = "SL is contained as a subset within L4/3",

abstract = "We present a deterministic algorithm that computes st-connectivity in undirected graphs using O(log4/3n) space. This improves the previous O(log3/2n) bound of Nisan, Szemeredi and Wigderson [NSW92].",

author = "Roy Armoni and Amnon Ta-Shma and Avi Wigderson and Shiyu Zhou",

year = "1997",

language = "אנגלית",

pages = "230--239",

journal = "Conference Proceedings of the Annual ACM Symposium on Theory of Computing",

issn = "0734-9025",

publisher = "Association for Computing Machinery",

note = "Proceedings of the 1997 29th Annual ACM Symposium on Theory of Computing ; Conference date: 04-05-1997 Through 06-05-1997",

}

TY - JOUR

T1 - SL is contained as a subset within L4/3

AU - Armoni, Roy

AU - Ta-Shma, Amnon

AU - Wigderson, Avi

AU - Zhou, Shiyu

PY - 1997

Y1 - 1997

N2 - We present a deterministic algorithm that computes st-connectivity in undirected graphs using O(log4/3n) space. This improves the previous O(log3/2n) bound of Nisan, Szemeredi and Wigderson [NSW92].

AB - We present a deterministic algorithm that computes st-connectivity in undirected graphs using O(log4/3n) space. This improves the previous O(log3/2n) bound of Nisan, Szemeredi and Wigderson [NSW92].

UR - https://www.scopus.com/pages/publications/0030671644

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:0030671644

SN - 0734-9025

SP - 230

EP - 239

JO - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

JF - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

T2 - Proceedings of the 1997 29th Annual ACM Symposium on Theory of Computing

Y2 - 4 May 1997 through 6 May 1997

ER -

SL is contained as a subset within L^4/3

Abstract

Other files and links

Fingerprint

Cite this