MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Symmetric Logspace is Closed Under Complement (1994) [23 citations — 1 self]

Abstract:

. We present a Logspace, many-one reduction from the undirected stconnectivity problem to its complement. This shows that SL = co \Gamma SL. y Institute of Computer Science, Hebrew University of Jerusalem. email: noam@cs.huji.ac.il. This work was supported by BSF grant 92-00043 and by a Wolfeson award administered by the Israeli Academy of Sciences. The work was revised while visiting BRICS, Basic Research in Computer Science, Centre of the Danish National Research Foundation. z Institute of Computer Science, Hebrew University of Jerusalem. email: am@cs.huji.ac.il. This work was supported by BSF grant 92-00043 and by a Wolfeson award administered by the Israeli Academy of Sciences. The work was revised while visiting BRICS, Basic Research in Computer Science, Centre of the Danish National Research Foundation. Online access for ECCC: FTP: ftp.eccc.uni-trier.de:/pub/eccc/ WWW: http://www.eccc.uni-trier.de/eccc/ Mail to: ftpmailftp.eccc.uni-trier.de, subject "MAIL ME CLEAR", body "pu...

Citations

213 Nondeterministic space is closed under complementation – Immerman - 1988
155 An O(n log n) sorting network – Ajtai, Komlos, et al. - 1983
127 Wigderson.Monotone circuits for connectivity require superlogarithmic depth – Karchmer, A - 1988
99 Widgerson: On span programs – Karchmer, A - 1993
97 The method of forced enumeration for nondeterministic automata – Szelepcsényi - 1988
52 Undirected connectivity in O(log 1.5 n) space – Nisan, Szemerédi, et al. - 1992
51 Lower bounds for deterministic and nondeterministic branching programs – Razborov - 1991
48 A complexity theory based on boolean algebra – Skyum, Valiant - 1985
46 Space-bounded hierarchies and probabilistic computations – Ruzzo, Simon, et al. - 1982
36 Symmetric space-bounded computation – Lewis, Papadimitriou - 1982
25 Symmetric complementation – Reif - 1982
18 The complexity of reconfiguring network models – Ben-Asher, Lange, et al. - 1994
12 Random walks, universal sequences and the complexity of maze problems – Aleliunas, Karp, et al. - 1979
9 Monotone separation of logspace from NC – Grigni, Sipser - 1991