Klaus Reinhardt, Eric Allender  Home/Search
Context Related
| rutgers.edu/pub/allender/nlul.pdf 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: rutgers.edu/~alle...complete_list (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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 )/poly Keywords: Nondeterministic space, Unambiguous computation, NLOG, ULOG, LogCFL AMS Subject Classification: 68Q15, 68Q10 # A preliminary version of this paper... (Update)
Context of citations to this paper: More
...word of the same length. An important part of our results, motivated by recent interest in classes intermediate between L and NL [2, 12, 14], is the investigation of the problem range in the variable case. Restricting the underlying morphism affects the complexity of the range...
...logspace; more formal definitions appear below. It was observed in [ARZ99] that the nonuniform collapse NL poly = UL poly of [RA00] holds also in the uniform case under a very plausible hypothesis. Namely, NL = UL if there is a set in DSPACE(n) that has exponential...
Cited by: More
Arithmetic Complexity, Kleene Closure, and Formal Power.. - Allender, Arvind, Mahajan (2003) (Correct)
NL-printable sets and Nondeterministic Kolmogorov Complexity - Allender (2004) (Correct)
The Complexity of Planarity Testing - Allender, Mahajan (2003) (Correct)
Similar documents (at the sentence level):
54.0%: Making Nondeterminism Unambiguous - Reinhardt, Allender (1998) (Correct)
Active bibliography (related documents): More All
0.7: SIGACT News Complexity Theory Column 19 - Hemaspaandra (1997) (Correct)
0.6: RUSPACE(log n) \subseteq DSPACE(log² n/log log n) - Allender, Lange (Correct)
0.5: Isolation, Matching, and Counting: Uniform and.. - Allender, Reinhardt.. (1998) (Correct)
Similar documents based on text: More All
0.3: On Maintaining Code Mobility - Schimkat, Friedrich, Küchlin (2001) (Correct)
0.2: Finding the Shore of a Lake - Reinhardt (Correct)
0.2: Encyclopaedia of Complexity Results for.. - Mundhenk.. (1997) (Correct)
Related documents from co-citation: More All
6: RAIRO Theoretical Information and Applications (context) - Allender, Ogihara et al. - 1996
6: Structure andimportance of the log-space mod class (context) - Buntrock, Damm et al. - 1992
6: A very hard logspace counting class (context) - Alvarez, Jenner - 1993
BibTeX entry: (Update)
K. Reinhardt and E. Allender. Making nondeterminism unambiguous. In Proc. of the 38th Annu. IEEE Symp. on Foundations of Computer Science, pages 244--253, 1977. http://citeseer.ist.psu.edu/reinhardt97making.html More
@inproceedings{ reinhardt97making,
author = "Klaus Reinhardt and Eric Allender",
title = "Making Nondeterminism Unambiguous",
booktitle = "{IEEE} Symposium on Foundations of Computer Science",
pages = "244-253",
year = "1997",
url = "citeseer.ist.psu.edu/reinhardt97making.html" }
Citations (may not include all citations):170 Nondeterministic space is closed under complement - Immerman - 1988
163 NP is as easy as detecting unique solutions (context) - Valiant, Vazirani - 1986
106 Matching is as easy as matrix inversion (context) - Mulmuley, Vazirani et al. - 1987
94 Complexity measures for public-key cryptosystems (context) - Grollmann, Selman - 1988
85 Turing machines that take advice (context) - Karp, Lipton - 1982
62 Lower bounds for deterministic and nondeterministic branchin.. - Razborov - 1992
56 Information Processing Letters (context) - Valiant, complexity et al. - 1976
54 Space bounded reducibility among combinatorial problems (context) - Jones - 1975
52 Journal of Computer and System Sciences (context) - Nisan, Wigderson et al. - 1994
52 A very hard log-space counting class (context) - Alvarez, Jenner - 1993
51 the tape complexity of deterministic contextfree languages (context) - Sudborough - 1978
48 Two applications of inductive counting for complementation p.. (context) - Borodin, Cook et al. - 1989
46 Counting auxiliary pushdown automata and semiunbounded arith.. (context) - Vinay - 1991
41 Properties that characterize LOGCFL (context) - Venkateswaran - 1991
38 Nondeterministic NC computation - Caussinus, McKenzie et al. - 1996
35 Circuit definitions of nondeterministic complexity classes (context) - Venkateswaran - 1992
28 The complexity of matrix rank and feasible systems of linear.. - Allender, Beals et al. - 1996
26 The method of forced enumeration for nondeterministic automa.. (context) - Szelepcsenyi - 1988
26 Counting problems computationally equivalent to the determin.. (context) - Toda - 1991
20 and arithmetic circuits (context) - Agrawal, Allender et al. - 1997
19 Fachbereich Informatik der Humboldt-Universitat zu Berlin (context) - Damm, Informatik-Preprint - 1991
16 Making computation count: Arithmetic circuits in the ninetie.. (context) - Allender - 1997
13 Lower bounds on the size of switching-and-rectifier networks.. (context) - Razborov - 1990
13 A note on tape-bounded complexity classes and linear context.. (context) - Sudborough - 1975
12 RAIRO - Theoretical Information and Application (context) - Allender, Ogihara et al. - 1996
12 Chicago Journal of Theoretical Computer Science (context) - Mahajan, Vinay et al. - 1997
11 Unambiguity and fewness for logarithmic space - Buntrock, Jenner et al. - 1991
10 Unambiguous auxiliary pushdown automata and semi-unbounded f.. - Niedermeier, Rossmanith - 1995
10 recognition of unambiguous context-free languages (context) - Rytter, log - 1987
9 The PL hierarchy collapses - Ogihara - 1998
8 Circuits over PP and PL - Beigel, Fu - 1997
7 arithmetic complexity classes: randomized reductions (context) - Gal, Wigderson - 1996
7 An unambiguous class possessing a complete set - Lange - 1997
7 Why is Boolean complexity theory di#cult (context) - Valiant - 1992
6 and counting: Uniform and nonuniform upper bounds (context) - Allender, Reinhardt et al.
5 Advocating ownership - Fernau, Lange et al. - 1996
4 Polynomials and combinatorial definitions of languages (context) - Regan - 1997
3 time parallel recognition of unambiguous context-free langua.. (context) - Rossmanith, Rytter et al. - 1992
1 Semi-unbounded fan-in circuits: Boolean vs (context) - Gal - 1995
1 Theory of Computing Systems (context) - Allender, Lange et al. - 1998
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://athos.rutgers.edu/~allender/publications/complete_list.html): More
Limitations of the Upward Separation Technique - Allender (1990) (Correct)
A Note on the Representational Incompatibility of Function.. - Allender, Kearns (2002) (Correct)
Algebraic Methods for Proving Lower Bounds in Circuit Complexity - Allender (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