Symmetric Logspace is Closed under Complement

Noam Nisan, Amnon Ta-Shma

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We present a Logspace, many-one reduction from the undirected st-connectivity problem to its complement. This shows that SL = CO – SL.
Original languageEnglish
Title of host publicationProceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995
Place of PublicationNew York, NY, USA
PublisherAssociation for Computing Machinery
Pages140–146
Number of pages7
ISBN (Print)0897917189, 9780897917186
DOIs
StatePublished - 1995
Externally publishedYes
Event27th Annual ACM Symposium on Theory of Computing, STOC'95 - Las Vegas, Nevada, United States
Duration: 29 May 19951 Jun 1995
Conference number: 27

Publication series

NameSTOC '95
PublisherAssociation for Computing Machinery
ISSN (Print)0737-8017

Conference

Conference27th Annual ACM Symposium on Theory of Computing, STOC'95
Abbreviated titleSTOC'95
Country/TerritoryUnited States
CityLas Vegas, Nevada
Period29/05/951/06/95

Fingerprint

Dive into the research topics of 'Symmetric Logspace is Closed under Complement'. Together they form a unique fingerprint.

Cite this