K.-J. Lange. An unambiguous class possessing a complete set. In Proc. 14th Symposium on Theoretical Aspects of Computer Science (STACS '97), volume 1200 of Lecture Notes in Computer Science, pages 339--350. Springer-Verlag, 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
NL-printable sets and Nondeterministic Kolmogorov Complexity - Allender (2003) (Correct)
....from s to t. If G contains more than one path from s to t,thenA mayormaynotcontain (G, s, t) Observe that the minimal solution to the Unique GAP promise problem (i.e. the language consisting of all triples (G, s, t) such that there is exactly one path from s to t in G) is complete for NL [Lan97] Of course, there are also nonrecursive solutions to the Unique GAP promise problem. Although the Unique GAP problem is the obvious graph theoretic characterization of UL, it is not known if UL contains any language that is a solution to the UniqueGAP promise problem. Even if UL has a complete ....
K.-J. Lange. An unambiguous class possessing a complete set. In Proc. STACS, volume 1200 of Lecture Notes in Computer Science, pages 339-- 350, 1997.
Making Nondeterminism Unambiguous - Reinhardt, Allender (1998) (5 citations) (Correct)
....to consider (nonuniform logspace reductions, or even nonuniform projections) In contrast, UL itself is not known to have any complete sets under logspace reducibility. In this regard, note that Lange has shown that one of the other unambiguous logspace classes does have complete sets [Lan97] It is disappointing that the techniques used in this paper do not seem to provide any new information about complexity classes such as NSPACE(n) and NSPACE(2 n ) It is straightforward to show that NSPACE(s(n) is contained in USPACE(s(n) 2 O(s(n) but this is interesting only for ....
K.-J. Lange. An unambiguous class possessing a complete set. In Proc. 14th Symposium on Theoretical Aspects of Computer Science (STACS '97), volume 1200 of Lecture Notes in Computer Science, pages 339--350. Springer-Verlag, 1997.
On the Complexity of Free Monoid Morphisms - Lange, McKenzie (1999) Self-citation (Lange) (Correct)
....between a circuit based language class and its functional counterpart. A morphism h : Sigma Delta is isometric iff h applied to each a 2 Sigma yields a 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 problem, e.g. the range problem for prefix codes is in L and is complete for this class. Now, one might expect that imposing the code property on h( Sigma) ....
....code is many one equivalent to the GAP problem L stu capturing StUSPACE(log n) and that a variant of range in which h( Sigma) is a stratified left partial code is RUSPACE(log n) complete. This is particularly interesting since RUSPACE(log n) was only recently found to have a complete problem [12]. Due to space restrictions many of our constructions cannot be given in detail. In particular, the proofs of corollary 3 and theorems 4, 7, 8, 9, and 10 have to be postponed to a full version of this paper. 3 2 Preliminaries 2.1 Complexity theory We assume familiarity with basic complexity ....
[Article contains additional citation context not shown here]
K.-J. Lange, An unambiguous class possessing a complete set, Proc. 14th Annual Symp. on Theoret. Aspects of Computer Science, Springer LNCS vol. 1200, pp. 339--350, 1997.
RUSPACE(log n) \subseteq DSPACE(log² n/log log n) - Allender, Lange Self-citation (Lange) (Correct)
....algorithms with a comparable running time [9] In the space bounded setting, until recently there had not been any corresponding computational problem whose complexity was best modeled by space bounded unambiguity. Recently, however, Lange presented a problem that is complete for RUSPACE(logn) [17]; this is the first explicit presentation of a problem in USPACE(logn) that is not known to be in DSPACE(logn) Completeness is a tool that is not often available in studying unambiguous classes. None of UP, USPACE(logn) or StUSPACE(logn) is known or believed to have complete sets. No problem ....
K.-J. Lange. An unambiguous class possessing a complete set. In Proc. of the 14th STACS, number 1200 in LNCS, pages 339--350. Springer, 1997.
StUSPACE(log n) \subseteq DSPACE(log² n/ log log n) - Allender, Lange Self-citation (Lange) (Correct)
.... USPACE(logn) In the time bounded setting, problems such as factoring and primality have efficient unambiguous algorithms but are not known to possess deterministic algorithms with a comparable running time [8] Recently, Lange presented a problem that is complete for a subclass of USPACE(logn) [15]; this is the first explicit presentation of a problem in USPACE(logn) that is not known to be in DSPACE(logn) Completeness is a tool that is not often available in studying unambiguous classes. None of UP, USPACE(logn) or StUSPACE(logn) is known or believed to have complete sets. No problem ....
K.-J. Lange. An unambiguous class possessing a complete set. Manuscript, 1996.
Making Nondeterminism Unambiguous - Reinhardt, Allender (1997) (5 citations) (Correct)
No context found.
K.-J. Lange. An unambiguous class possessing a complete set. In Proc. 14th Symposium on Theoretical Aspects of Computer Science (STACS '97), volume 1200 of Lecture Notes in Computer Science, pages 339--350. Springer-Verlag, 1997.
NL-printable sets and Nondeterministic Kolmogorov Complexity - Allender (2004) (Correct)
No context found.
K.-J. Lange. An unambiguous class possessing a complete set. In Proc. STACS, volume 1200 of Lecture Notes in Computer Science, pages 339--350, 1997.
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