Abstract
We present a Logspace, many-one reduction from the undirected st-connectivity problem to its complement. This shows that SL = CO – SL.
Original language | English |
---|---|
Title of host publication | Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing |
Place of Publication | New York, NY, USA |
Publisher | Association for Computing Machinery |
Pages | 140–146 |
ISBN (Print) | 0897917189 |
DOIs | |
State | Published - 1995 |
Event | 27th annual ACM symposium on Theory of computing, STOC 1995 - Las Vegas, United States Duration: 29 May 1995 → 1 Jun 1995 Conference number: 27 https://dl.acm.org/doi/proceedings/10.1145/225058 |
Publication series
Name | STOC '95 |
---|---|
Publisher | Association for Computing Machinery |
Conference
Conference | 27th annual ACM symposium on Theory of computing, STOC 1995 |
---|---|
Abbreviated title | STOC '95 |
Country/Territory | United States |
City | Las Vegas |
Period | 29/05/95 → 1/06/95 |
Internet address |
Keywords
- Graph algorithms
- Turing machines