Topic
L
About: L is a research topic. Over the lifetime, 55 publications have been published within this topic receiving 2035 citations. The topic is also known as: el & Lima.
Papers published on a yearly basis
Papers
TL;DR: Every family of languages, recognized by nondeterministic L(n) tape-bounded Turing machines, where L( n)≥logn, is closed under complement, and as a special case, the family of context-sensitive languages isclosed under complement.
Abstract: Every family of languages, recognized by nondeterministic L(n) tape-bounded Turing machines, where L(n)≥logn, is closed under complement As a special case, the family of context-sensitive languages is closed under complement This solves the open problem from [4]
447 citations
TL;DR: Several problems complete for deterministic logarithmic space under NC1 (i.e., log depth) reducibility are exhibited, including breadth- first search and depth-first search of an undirected tree, connectivity of undirectED graphs known to be made up of one or more disjoint cycles, undirecting graph acyclicity, and several problems related to representing and to operating with permutations of a finite set.
211 citations
12 Nov 2000
TL;DR: This paper shows that the graph isomorphism problem is hard under logarithmic space many-one reductions for the complexity classes NL, PL, and Mod/sub k/L and for the class DET of problems NC/sup 1/ reducible to the determinant.
Abstract: We show that the graph isomorphism problem is hard under logarithmic space many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space), for every logarithmic space modular class Mod/sub k/L and for the class DET of problems NC/sup 1/ reducible to the determinant. These are the strongest existing hardness results for the graph isomorphism problem, and imply a randomized logarithmic space reduction from the perfect matching problem to graph isomorphism.
129 citations
19 Oct 1997
TL;DR: In this paper, it was shown that in the context of nonuniform complexity, non-deterministic logarithmic space bounded computation can be made unambiguous, and this result holds for the class of problems reducible to context-free languages.
Abstract: We show that in the context of nonuniform complexity, nondeterministic logarithmic space bounded computation can be made unambiguous. An analogous result holds for the class of problems reducible to context-free languages. In terms of complexity classes, this can be stated as: NL/poly=UL/poly LogCFL/poly=UAuxPDA(log n, n/sup O(1)/)/poly.
85 citations
[...]
TL;DR: It is proved that certain standard complete problems for static complexity classes, such as REACHafor P, remain complete via these new reductions, and that other such problems, including REACH for NL and REACHdfor L, are no longer complete via bounded-expansion reductions.
58 citations
Related Topics (5)
Performance Metrics
| Year | Papers |
|---|---|
| 2016 | 1 |
| 2015 | 2 |
| 2014 | 3 |
| 2013 | 1 |
| 2012 | 2 |
| 2011 | 1 |