Carme Alvarez, Raymond Greenlaw  Home/Search
Context Related
| armstrong.edu/~greenlaw...compendium.ps armstrong.edu/greenlaw/...compendium.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: armstrong.edu/~greenlaw/...papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . The paper's main contributions are a compendium of problems that are complete for symmetric logarithmic space (SL), a collection of material relating to SL, a list of open problems, and an extension to the number of problems known to be SL-complete. Complete problems are one method of studying SL, a class for which programming is nonintuitive. Our exposition helps make the class SL less mysterious and more accessible to other researchers. Key words. Completeness, SL, space complexity,... (Update)
Context of citations to this paper: More
.... viewpoint of computational complexity, since there are quite few natural and nonobvious SL complete problems in formal language theory, see [2]. 2 Preliminaries We assume some familiarity with computational complexity, see e.g. 21] in particular with circuit complexity, see...
...a given graph has more than one connected component. UCC belongs to SL but it seems easier than UGAP and it is not known to be complete for SL [19]. 2 Preliminaries We assume familiarity with basic notions of complexity theory such as can be found in the standard books in the...
Cited by: More
Derandomization That is Rarely Wrong From Short Advice.. - Goldreich, Wigderson (2002) (Correct)
The Complexity of Planarity Testing - Allender, Mahajan (2003) (Correct)
The Complexity of Graph Isomorphism for Colored Graphs.. - Köbler, Torán (Correct)
Similar documents (at the sentence level):
65.9%: A Compendium of Problems Complete for Symmetric Logarithmic.. - Alvarez, Greenlaw (1996) (Correct)
Active bibliography (related documents): More All
0.5: Traversal of a Quasi-Planar Subdivision without.. - Chavez, Dobrev.. (2004) (Correct)
0.3: Quantum Finite Multitape Automata - Ambainis, Bonner, Freivalds.. (1999) (Correct)
0.3: PSPACE-complete problems for subgroups of free groups .. - Birget, Margolis.. (2000) (Correct)
Similar documents based on text: More All
0.2: Efficient and Reliable High Level Communication in.. - Alvarez, Diaz.. (2004) (Correct)
0.2: A Compendium of Problems Complete for P - Greenlaw, Hoover, Ruzzo (1991) (Correct)
0.1: Global Illumination Compendium - Dutre (2001) (Correct)
Related documents from co-citation: More All
6: Symmetric logspace is closed under complement - Nisan, Ta-Shma - 1995
3: and logarithmic space (context) - Etessami, successor - 1995
3: Symmetric space-bounded computation (context) - Papadimitriou - 1982
BibTeX entry: (Update)
C. ' Alvarez and R. Greenlaw. A compendium of problems complete for symmetric logarithmic space. Technical Report TR96-039, Electronic Colloquium on Computational Complexity, http://www.eccc.uni-trier.de/eccc/, 1996. http://citeseer.ist.psu.edu/alvarez96compendium.html More
@article{ alvarez96compendium,
author = "Carme Alvarez and Raymond Greenlaw",
title = "A Compendium of Problems Complete for Symmetric Logarithmic Space",
journal = "Electronic Colloquium on Computational Complexity (ECCC)",
volume = "3",
number = "039",
year = "1996",
url = "citeseer.ist.psu.edu/alvarez96compendium.html" }
Citations (may not include all citations):1911 Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
773 Reducibility among combinatorial problems (context) - Karp - 1972
356 Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
274 A catalog of complexity classes (context) - Johnson - 1990
211 Languages that capture complexity classes - Immerman - 1987
170 Nondeterministic space is closed under complementation - Immerman - 1988
168 A taxonomy of problems with fast parallel algorithms (context) - Cook - 1985
150 Computational Complexity (context) - Papadimitriou - 1994
97 Limits to Parallel Computation: P-Completeness Theory - Greenlaw, Hoover et al. - 1995
74 Inference of reversible languages (context) - Angluin - 1982
65 universal traversal sequences (context) - Aleliunas, Karp et al. - 1979
62 Lower bounds for deterministic and nondeterministic branchin.. - Razborov - 1991
53 A characterization of comparability graphs and of interval g.. (context) - Gilmore, Hoffman - 1964
48 Two applications of inductive counting for complementation p.. (context) - Borodin, Cook et al. - 1989
43 Symmetric space-bounded computation (context) - Lewis, Papadimitriou - 1982
42 The method of forced enumeration for nondeterministic automa.. (context) - Szelepcs'enyi - 1988
32 Space-bounded hierarchies and probabilistic computations (context) - Ruzzo, Simon et al. - 1984
29 Problems complete for deterministic logarithmic space (context) - Cook, McKenzie - 1987
26 space trade-offs for reversible computation (context) - Bennett - 1989
25 Symmetric logspace is closed under complement - Nisan, Ta-Shma - 1995
18 New problems complete for nondeterministic log space (context) - Jones, Lien et al. - 1976
17 Symmetric complementation (context) - Reif - 1984
8 Deterministic algorithms for undirected s-t connectivity usi.. - Barnes, Ruzzo - 1991
6 Complete problems for symmetric logspace involving free grou.. (context) - Stewart - 1991
4 Reversible space equals deterministic space (context) - Lange, McKenzie et al. - 1997
4 Parallel algorithms in graph theory: Planarity testing (context) - Janos - 1982
3 Refining known results on the generalized word problem for f.. (context) - Stewart - 1992
3 Information Processing Letters (context) - Jenner, for - 1995
3 On reversible automata (context) - Pin - 1992
2 connectivity in polynomial time and sublinear space (context) - Barnes, Ruzzo et al. - 1997
2 Optimal tree ranking is in NC (context) - Torre, Greenlaw et al. - 1992
2 the languages accepted by finite reversible automata (context) - Pin - 1987
1 Endre Szemer' edi (context) - SL-complete, Noam - 1992
1 In Formal Language Theory (context) - Monien, Sudborough et al. - 1980
1 a complexity hierarchy between L and NL (context) - Cho, Huynh - 1988
1 and Shiyu Zhou (context) - Armoni, Ta-Shma et al. - 1997
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.students.armstrong.edu/~greenlaw/research/papers.html): More
Breadth-Depth Search is P-complete - Greenlaw (1994) (Correct)
A Model Classifying Algorithms as Inherently Sequential with.. - Greenlaw (1992) (Correct)
Optimal Edge Ranking of Trees in Polynomial Time - Torre, Greenlaw, Schäffer (1993) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC