R. Szelepcsenyi. The method of forced enumeration for nondeterministic automata. Acta Informatica, 26:279-- 284, 1988. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
Game Representations of Complexity Classes - McColm (2001) (Correct)
....FO pos TC expressible queries are precisely the NLOGSPACE computable queries. It is quirkier than FO LFP: Remark 1. 2 In general, the class of FO pos TC expressible queries is not closed under negation ( GrM96] however, in the presence of an ordering, FO pos TC is closed under negation ([I88, Sz88]) and thus NLOGSPACE is closed under complementation. 1.2 Second Order Logics Second order (SO) logic permits the use of relation variables, such as the following sentence for connectivity on graphs: 8S [ 9xS(x) 9y:S(y) 9x9y(S(x) S(y) Edge(x; y) We will look at three logics ....
R. Szelepcs'enyi, The Method of Forced Enumeration for Nondeterministic Automata, Acta Informatica 26 (1988), 279--284.
Symmetric Logspace is Closed Under Complement - Nissin, al. (1994) (Correct)
.... non trivial one in the line above and follows directly from the randomized Logspace algorithm for USTCON of [AKL 79] It is also known that SL SC [Nis92] SL L L [KW93] and SL DSPACE(log n) NSW92] After the surprising proofs that NL is closed under complement were found [Imm88, Sze88] Borodin et al. [BCD 89] asked whether the same is true for SL. They could prove only the weaker statement, namely that SL co Gamma RL, and left SL = co Gamma SL as an open problem. In this paper we solve the problem in the affirmative by exhibiting a Logspace, many one reduction from ....
Szelepcsenyi. The method of forced enumeration for nondeterministic automata. Acta Informatica, 26,
When Worlds Collide: Derandomization, Lower Bounds, and.. - Allender (Correct)
....show a majority believing BPP = PandMA=AM=NP. Such swings of opinion are a sure sign of important progress in the field. Consider the likely outcome of taking similar polls about whether NL=coNL, or whether IP=PSPACE, before and after the announcements that these problems had been settled [Imm88,Sze88,LFKN92,Sha92]. In the case of BPP, MA, and AM, our new understanding of these classes can be credited to advances in the field of derandomization a field that is so large and active that I will not pretend to be able to survey it here. Rather, I will focus on a few recent and exciting developments in the ....
R. Szelepcsenyi. The method of forced enumeration for nondeterministic automata. Acta Informatica, 26:279--284, 1988.
Basic Complexity - Allender, McCartin (Correct)
....optimal. How about nondeterministic space bounded classes Are they closed under complementation Note that Savitch s Theorem implies that A # Nspace(s) # A # Nspace(s 2 ) People had believed that this quadratic overhead might be optimal. Surprisingly, Immerman [Imm88] and Szelepcsenyi [Sze88] proved that Nspace(s) is closed under complementation Another problem related to the complementation of NDTM s is that direct diagonalization doesn t work. To see why, consider the diagonalization argument we gave in Lecture 1, to prove the time hierarchy theorem. The crucial step there was ....
R. Szelepcsenyi. The method of forced enumeration for nondeterministic automata. Acta Informatica, 26:279--284, 1988.
On the Hardness of Graph Isomorphism - Torán (2000) (6 citations) (Correct)
....for NL under logarithm space many one reductions. Proof. The graph accessibility problem for acyclic directed graphs with fan in at most 2 is complete for the class NL. We reduce the complementary of this set (nonreachability) to GI. The result follows by the closure of NL under complementation [15, 31]. Let G = V; E) be such a graph, with jV j = n and with two designated nodes s and t. Let P the number of paths from s to t in G, clearly P 2 n . Let p 1 ; pm be the m smallest prime numbers, and let m be the smallest integer such that Q m i=1 p i 2 n . By the CRT P = 0 if and ....
R. Szelepcsenyi. The method of forced enumeration for nondeterministic automata. Acta Informatica 26:279--284, 1988.
Refining Randomness - Ta-Shma (1996) (Correct)
.... RL NL. If we have to guess if these containments are tight what would be our first (or second) guess I guess NO . and as usually happens in complexity theory (and in life in general) pessimism rules until someone shows the contrary 7 . Thus, the proofs by Immerman and Szelepcseny [Imm88, Sze88] that NL is closed under complement, came as a great surprise to the scientific community. The same technique, inductive counting, was used by Borodin et al. [BCD 89] to 7 But, in fact, what do we have to base our guess on Do we have the slightest indication that L 6= NL If we have any ....
Szelepcsenyi. The method of forced enumeration for nondeterministic automata. Acta Informatica, 26, 1988.
Complexity Theoretical Results for Randomized Branching Programs - Sauerhoff (1999) (Correct)
....2.3 are fg branching programs in the sense of this definition. The case Omega = fg corresponds to co nondeterministic acceptance, and the class of functions with fg branching programs of polynomial size is the same as coNL= Poly = coNP BP. By the famous result of Immerman [52] and Szelepcsenyi [108], it follows that these classes are also identical to NL= Poly. Theorem 2.7 (Immerman Szelepcs enyi) NP BP = coNP BP. The class of functions representable by f; g branching programs of polynomial size coincides with the class P= Poly. This is due to the fact that every circuit of polynomial ....
R. Szelepcsenyi. The method of forced enumeration for nondeterministic automata. Acta Informatica, 279--284, 1988.
Complexity: A Language-Theoretic Point of View - Calude, Hromkovic (1995) (Correct)
....do not know whether SPACE(s(n) is equal to NSPACE(s(n) or not. Since all deterministic classes are closed under complementation people have hoped to prove SPACE(s(n) is not equal to NSPACE(s(n) by proving that NSPACE(s(n) is not closed under complementation. But Immerman [94] and Szelepcsenyi [138] have proved that this idea cannot work because all classes NSPACE(s(n) for s(n) # log n are closed under complementation too. 1.5. PARALLELISM 37 Theorem 1.35 [45] For any function t, t(n) # n, AT IME(t(n) # DSPACE(t(n) Idea of proof. Let M be an alternating TM, and let Tr M(x ) is ....
R. Szelepcsenyi, The method of forced enumeration for nondeterministic automata, Acta Informatica 26 (1988), 279--284.
Symmetric Logspace is Closed Under Complement - Nisan, Ta-Shma (1995) (24 citations) (Correct)
.... one in the line above and follows directly from the randomized Logspace algorithm for USTCON of [AKL 79] It is also known that SL SC [Nis92] SL L L [KW93] and SL DSPACE(log 1:5 n) NSW92] After the surprising proofs that NL is closed under complement were found [Imm88, Sze88] Borodin et al. [BCD 89] asked whether the same is true for SL. They could prove only the weaker statement, namely that SL coRL, and left SL = coSL as an open problem. In this paper we solve the problem in the affirmative by exhibiting a Logspace, many one reduction from USTCON to its ....
Szelepcsenyi. The method of forced enumeration for nondeterministic automata. Acta Informatica, 26, 1988. 9
The Complexity of Planarity Testing - Allender, Mahajan (2000) (1 citation) (Correct)
....Tutte [28] when combined with more recent results about span programs and counting classes [14] gives a #L algorithm for planarity testing. It is listed as an open question by Ja Ja and Simon [13] if planarity is in NL, although the subsequent discovery that NL is closed under complementation [11, 27] allows one to verify that one of the algorithms of [12, 13] can in fact be implemented in NL. It remains an open question if their algorithm can be implemented in SL, but in this paper we observe that the algorithm of Ramachandran and Reif can be implemented in SL. We also show that the ....
R. Szelepcsenyi. The method of forced enumeration for nondeterministic automata. Acta Informatica, 26(3):279--284, 1988.
New Computing Paradigms Suggested by DNA Computing.. - Martín-Vide, Paun (1998) (2 citations) (Correct)
....context sensitive language is C REG computable. ii) The family of C REG computable languages is incomparable with the family of recursively enumerable languages. Proof. Assertion (i) follows from the fact that the family of context sensitive languages is closed under the complementation, see [9] [19]. Assertion (ii) is a consequence of the non closure of the family of recursively enumerable languages under the complementation. We do not know whether or not Theorem 3 (and assertion (i) in Corollary 1) remains true for other, more restrictive, definitions of a regular sequence of languages. ....
R. Szelepcsenyi, The method of forced enumeration for nondeterministic automata, Acta Inform., 26, 3 (1988), 279 -- 284.
Iterated GSM Mappings: A Collapsing Hierarchy - Manca, Martín-Vide (1998) (1 citation) (Correct)
....language is C REG computable. ii) The family of C REG computable languages is incomparable with the family of recursively enumerable languages. Proof. Assertion (i) follows from the fact that the family of contextsensitive languages is closed under the complementation, see [10] [21]. Assertion (ii) is a consequence of the non closure under the complementation of the family of recursively enumerable languages. In order to put the previous result in a better perspective, let us denote by Co RE the family of complements of recursively enumerable languages and by UREG the family ....
R. Szelepcsenyi, The method of forced enumeration for nondeterministic automata, Acta Inform., 26, 3 (1988), 279 -- 284.
The Complexity of Reconfiguring Network Models - Ben-Asher, Lange, Peleg.. (1992) (3 citations) (Correct)
....construct hierachies over complexity classes: bounded alternation and Turing reducibilities, i.e. the use of oracle machines. In the case of nondeterministic space classes the resulting hierarchies both collapse on the first level and coincide with the original nondeterministic class (see [Imm88, Sze88] For symmetric space the hierarchy based on alternation was introduced in [Rei84] In the following we shortly introduce an oracle based analogue and then prove that it coincide with RN (O(1) poly(N) There are two main possibilities to relativize space bounded classes, i.e. to equippe space ....
....c. SLH : S k O Sigma SL k : We mention in passing, that the whole symmetric logspace alternation hierarchy is contained in L SL which is a subset of O Sigma SL 2 . This resembles exactly the situation in the nonderministic case before the result of Immerman and Szelepcsenyi ( RST84, Imm88, Sze88] Based on this definition we can state the first half of the main result of this subsection: Theorem 5.17 a. For each positive integer k we have RN (k,poly(N) L O Sigma SL k and hence b. RN (O(1) poly(N) SLH Proof: The proof of part a. follows via induction over the running time k of ....
[Article contains additional citation context not shown here]
R. Szelepcsenyi. The method of forced enumeration for nondeterministic automata. Acta Informatica, 26(3):279--284, 1988.
A second-order theory for NL - Stephen Cook And (2004) (Correct)
No context found.
R. Szelepcsenyi. The method of forced enumeration for nondeterministic automata. Acta Informatica, 26:279-- 284, 1988.
CS278: Computational Complexity - Spring These Are (Correct)
No context found.
R. Szelepcsenyi. The method of forced enumeration for nondeterministic automata. Acta Informatica, 26:279--284, 1988. 147
Symmetric Logspace is Closed under Complement - Nisan, al. (1995) (24 citations) (Correct)
No context found.
R. Szelepcsenyi. The method of forced enumeration for nondeterministic automata. Acta Informatica, 26, 1988. 11
Complexity Theory - Allender, Loui, Regan (2004) (Correct)
No context found.
Szelepcsenyi, R. 1988. The method of forced enumeration for nondeterministic automata. Acta Informatica, 26(3):279--284.
Complexity Classes - Allender, Loui, Regan (Correct)
No context found.
R. Szelepcsenyi. The method of forced enumeration for nondeterministic automata. Acta Informatica, 26:279--284, 1988.
Making Nondeterminism Unambiguous - Reinhardt, Allender (1997) (5 citations) (Correct)
No context found.
R. Szelepcsenyi. The method of forced enumeration for nondeterministic automata. Acta Informatica, 26:279--284, 1988.
Negation and Inductive Norms - McColm (2003) (Correct)
No context found.
R. Szelepcsenyi, "The method of forced enumeration for nondeterministic automata, " Acta Inform. 26:3 (1988), 279 -- 284, MR 89k:68087.
Refining Randomness - Ta-Shma (1996) (Correct)
No context found.
Szelepcsenyi. The method of forced enumeration for nondeterministic automata. Acta Informatica, 26, 1988.
NL-printable sets and Nondeterministic Kolmogorov Complexity - Allender (2004) (Correct)
No context found.
Robert Szelepcsenyi. The method of forced enumeration for nondeterministic automata. Acta Informatica, 26(3):279--284, 1988. 22
Characterizing Small Depth and Small Space Classes .. - Agrawal.. (Correct)
No context found.
R. Szelepcsenyi. The method of forced enumeration for nondeterministic automata. Acta Informatica, 26:279--284, 1988.
The Complexity of Planarity Testing - Allender, Mahajan (2003) (1 citation) (Correct)
No context found.
Robert Szelepcsenyi. The method of forced enumeration for nondeterministic automata. Acta Informatica, 26(3):279--284, 1988.
On Separators, Segregators and Time versus Space - Santhanam (Correct)
No context found.
R.Szelepcsenyi. The method of forced enumeration for nondeterministic automata. Acta Informatica, 26:279-284, 1988.
First 50 documents
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