Article

Free access

Symmetric logspace is closed under complement

Authors:

Noam Nisan,

Amnon Ta-ShmaAuthors Info & Claims

STOC '95: Proceedings of the twenty-seventh annual ACM symposium on Theory of computing

Pages 140 - 146

https://doi.org/10.1145/225058.225101

Published: 29 May 1995 Publication History

PDF eReader

References

[1]

R. Aleliunas, R.M. Karp, R.J. Lipton, L. Lovasz, and C. Rack-off. Random walks, universal se-quences and the complexity of maze problems. In Proceedings of the 20th Annual IEEE Symposium on the Foundations of Computer Science, 1979.

Digital Library

Google Scholar

[2]

M. Ajtai, J. Komlos, and E. Sze-meredi. An O ( n log n) sorting net work. In Proc. 15th ACM Symposium on Theory of Com-puting (STOC), pages 1-9, 1983.

Digital Library

Google Scholar

[3]

A. Borodin, S.A. Cook, P.W. Dymond, W.L. Ruzzo, and M. Tompa. Two applications of inductive count-ing for complementation prob-lems. SIAM Journal on Com-puting, 18(3):559-578, 1989.

Digital Library

Google Scholar

[4]

Y. Ben-Asher, D. Peleg, and A. Schuster. The complexity of reconfiguring net works models. In Proc. of the Israel Symposium on the Theory of Computing and Systems, May 1992. To appear Information and Computation.

Digital Library

Google Scholar

[5]

Grigni and Sipser. Mono-tone separation of logspace from ncl. In Annual Conference on Structure in Complexity Theory, 1991.

Google Scholar

[6]

Immerman. Nondeterministic space is closed under comple-ment ation. SIAM Journul on Computing, 17, 1988.

Digital Library

Google Scholar

[7]

M. Karchmer and A. Wigderson. Monotone circuits for connec-tivity require super-logarithmic depth. In Proc. 20th ACM Sym-posium on Theory of Computing (STOC), pages 539-550, 1988.

Digital Library

Google Scholar

[8]

Karchmer and Wigderson. On span programs. In Annual Conf-erence on Structure in Com-plexity Theory, 1993.

Google Scholar

[9]

Lewis and Papadimitriou. Sym-metric space-bounded computa-tion. Theoretical Computer Sci-ence, 19, 198Z.

Google Scholar

[10]

N. Nisan. RL C SC. In Proc. 2dth ACM Symposium on Theory of Computing (S TO C), pages 619-623, 1992.

Digital Library

Google Scholar

[11]

N. Nisan, E. Szemeredi, and A. Wigderson. Undirected con-nectivity in 0( logl"5n) space. In Proc. 33th IEEE Symposium on Foundations of Computer Science (FOCS), pages 24-29, 1992.

Digital Library

Google Scholar

[12]

A. Razborov. Lower bounds for deterministic and nondetermin-istic branching programs. In Proceedings of the 8th FCT, Lec-ture Notes in Computer Sci-ence, 529, pages 47-60, New York/Berlin, 1991. Springer-TJerlag.

Digital Library

Google Scholar

[13]

J. H. Reif. Symmetric comple-mentation. In Proc. Iith A C.14 Symposium on Theory of Com-puting (STOC), pages 201-214, 1982.

Digital Library

Google Scholar

[14]

Ruzzo, Simon, and Tompa. Space-bounded hi-erarchies and probabilistic com-putations. Journal of Computer and System Sciences, 28:216- 230, April 1984.

Crossref

Google Scholar

[15]

SkYum and Valiant. A com-plexity theory based on boolean algebra. Journal of the ACM, 198.5.

Digital Library

Google Scholar

[16]

Szelepcsenyi. The method of forced enumeration for nonde-terministic automata. Acts In-formaticu, 26, 1988.

Digital Library

Google Scholar

Cited By

View all

Nanongkai DScquizzato M(2022)Equivalence classes and conditional hardness in massively parallel computationsDistributed Computing10.1007/s00446-021-00418-2Online publication date: 20-Jan-2022
https://doi.org/10.1007/s00446-021-00418-2
Elberfeld MKawarabayashi KShmoys D(2014)Embedding and canonizing graphs of bounded genus in logspaceProceedings of the forty-sixth annual ACM symposium on Theory of computing10.1145/2591796.2591865(383-392)Online publication date: 31-May-2014
https://dl.acm.org/doi/10.1145/2591796.2591865
Moore CMertens S(2013)Mathematical ToolsThe Nature of Computation10.1093/acprof:oso/9780199233212.005.0001(911-943)Online publication date: 17-Dec-2013
https://doi.org/10.1093/acprof:oso/9780199233212.005.0001
Show More Cited By

Index Terms

Symmetric logspace is closed under complement
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Graph algorithms
2. Theory of computation
  1. Computational complexity and cryptography
    1. Problems, reductions and completeness
  2. Models of computation
    1. Computability
      1. Turing machines

Recommendations

Logspace Optimization Problems and Their Approximability Properties

Logspace optimization problems are the logspace analogues of the well-studied polynomial-time optimization problems. Similarly to them, logspace optimization problems can have vastly different approximation properties even though their underlying ...
Symmetric Logspace is Closed Under Complement
Canonizing Graphs of Bounded Tree Width in Logspace

Graph canonization is the problem of computing a unique representative, a canon, from the isomorphism class of a given graph. This implies that two graphs are isomorphic exactly if their canons are equal. We show that graphs of bounded tree width can be ...

Comments

Information & Contributors

Information

Published In

STOC '95: Proceedings of the twenty-seventh annual ACM symposium on Theory of computing

May 1995

776 pages

ISBN:0897917189

DOI:10.1145/225058

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 29 May 1995

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC95

Sponsor:

SIGACT

STOC95: Symposium on Theory of Computing

May 29 - June 1, 1995

Nevada, Las Vegas, USA

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

44
Total Citations
View Citations
379
Total Downloads

Downloads (Last 12 months)50
Downloads (Last 6 weeks)4

Reflects downloads up to 02 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Nanongkai DScquizzato M(2022)Equivalence classes and conditional hardness in massively parallel computationsDistributed Computing10.1007/s00446-021-00418-2Online publication date: 20-Jan-2022
https://doi.org/10.1007/s00446-021-00418-2
Elberfeld MKawarabayashi KShmoys D(2014)Embedding and canonizing graphs of bounded genus in logspaceProceedings of the forty-sixth annual ACM symposium on Theory of computing10.1145/2591796.2591865(383-392)Online publication date: 31-May-2014
https://dl.acm.org/doi/10.1145/2591796.2591865
Moore CMertens S(2013)Mathematical ToolsThe Nature of Computation10.1093/acprof:oso/9780199233212.005.0001(911-943)Online publication date: 17-Dec-2013
https://doi.org/10.1093/acprof:oso/9780199233212.005.0001
Moore CMertens SMoore CMertens S(2013)Quantum ComputationThe Nature of Computation10.1093/acprof:oso/9780199233212.003.0015(819-910)Online publication date: 17-Dec-2013
https://doi.org/10.1093/acprof:oso/9780199233212.003.0015
Moore CMertens SMoore CMertens S(2013)When Formulas Freeze: Phase Transitions in ComputationThe Nature of Computation10.1093/acprof:oso/9780199233212.003.0014(723-818)Online publication date: 17-Dec-2013
https://doi.org/10.1093/acprof:oso/9780199233212.003.0014
Moore CMertens SMoore CMertens S(2013)Counting, Sampling, and Statistical PhysicsThe Nature of Computation10.1093/acprof:oso/9780199233212.003.0013(651-665)Online publication date: 17-Dec-2013
https://doi.org/10.1093/acprof:oso/9780199233212.003.0013
Moore CMertens SMoore CMertens S(2013)Random Walks and Rapid MixingThe Nature of Computation10.1093/acprof:oso/9780199233212.003.0012(563-650)Online publication date: 17-Dec-2013
https://doi.org/10.1093/acprof:oso/9780199233212.003.0012
Moore CMertens SMoore CMertens S(2013)Interaction and PseudorandomnessThe Nature of Computation10.1093/acprof:oso/9780199233212.003.0011(506-562)Online publication date: 17-Dec-2013
https://doi.org/10.1093/acprof:oso/9780199233212.003.0011
Moore CMertens SMoore CMertens S(2013)Randomized AlgorithmsThe Nature of Computation10.1093/acprof:oso/9780199233212.003.0010(450-505)Online publication date: 17-Dec-2013
https://doi.org/10.1093/acprof:oso/9780199233212.003.0010
Moore CMertens SMoore CMertens S(2013)Optimization and ApproximationThe Nature of Computation10.1093/acprof:oso/9780199233212.003.0009(351-449)Online publication date: 17-Dec-2013
https://doi.org/10.1093/acprof:oso/9780199233212.003.0009
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Logspace Optimization Problems and Their Approximability Properties