Symmetric Logspace is Closed under Complement

Noam Nisan, Amnon Ta-Shma

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


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
Place of PublicationNew York, NY, USA
PublisherAssociation for Computing Machinery
ISBN (Print)0897917189
StatePublished - 1995
Event27th annual ACM symposium on Theory of computing, STOC 1995 - Las Vegas, United States
Duration: 29 May 19951 Jun 1995
Conference number: 27

Publication series

NameSTOC '95
PublisherAssociation for Computing Machinery


Conference27th annual ACM symposium on Theory of computing, STOC 1995
Abbreviated titleSTOC '95
Country/TerritoryUnited States
CityLas Vegas
Internet address


  • Graph algorithms
  • Turing machines


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

Cite this