Chandra, A. K., Kozen, D., and Stockmeyer, L. (1981). Alternation. Journal of the ACM, 28:114--133. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Focus Games for Satisfiability and Completeness of Temporal.. - Lange, Stirling (2001) (1 citation) (Correct)
....Proof: The proof is very similar to that of Proposition 3 of Section 3. However, the tree of all plays is now an and or tree because of player # s choices using rule next. Therefore the polynomial space algorithm deciding the winner of G # (# 0 ) is alternating instead of nondeterministic. By [3] the problem is therefore in EXPTIME. # 6 A complete axiomatisation for CTL The game theoretic characterisation of CTL satisfiability also allows one to extract a sound and complete axiom system for CTL, the system B in Figure 4. Theorem 1 The axiom system B is sound and complete for CTL. ....
Chandra, A., Kozen, D. and Stockmeyer, L. (1981). Alternation. Journal of ACM, 28, 114-133.
Parallel Computation: Models and Complexity Issues - Greenlaw, Hoover (1996) (Correct)
....of the other parallel models. Theorem 4.6 [Savitch and Stimson, 1979] If T (n) n is k PRAM countable then NSPACE(T (n) k NPRAM TIME(T (n) 2 ) If T (n) n is RAM constructible then k NPRAM TIME(T (n) NSPACE(T (n) 3 ) 4.3. 5 Alternating Turing Machines An alternating Turing machine, [Chandra et al. 1981], is a generalization of a nondeterministic Turing machine to have universal acceptance states as well as existential acceptance states. See Chapter 33. ATM resources are time, space, and alternation, where alternation counts the maximum number of changes between existential and universal ....
....(n) is VM countable and T (n) log n then NSPACE(T (n) VM TIME(T (n) 2 ) If T (n) is RAM constructible and T (n) log n then VM TIME(T (n) DSPACE(T (n) 2 ) Theorem 4.15 [Fortune and Wyllie, 1978] CREW PRAM TIME(T (n) DSPACE(T (n) 2 ) CREW PRAM TIME(T (n) 2 ) Theorem 4. 16 [Chandra et al. 1981] ATIME(T (n) DSPACE(T (n) NSPACE(T (n) ATIME(T (n) 2 ) The proofs of the simulation of sequential space by parallel time are similar to, and motivated by, Savitch s Theorem (see Chapter 33) The general structure of such proofs is as follows: 1. Let M be an S(n) space bounded Turing ....
Chandra, A. K., Kozen, D. C., and Stockmeyer, L. J. 1981. Alternation. Journal of the ACM, 28(1):114--133.
A Calculus for Access Control in Distributed Systems - Abadi, Burrows, Lampson.. (1991) (144 citations) (Correct)
....branching due to alternates with the existential branching that comes from choosing between rules of the encoded grammars. Using these ideas, we have sketched a proof that the problem of making access control decisions is equivalent to the acceptance problem for alternating pushdown automata [6]. It follows that the fairly general access control problem that we posed requires exponential time. We believe that the inclusion of various reasonable properties for roles and for D does not worsen this complexity. We have considered some of the cases. Although all of the expressions involved ....
Chandra, A., Kozen, D., and Stockmeyer, L. Alternation. J. ACM 28 , 1 (Jan. 1981), 114--133.
Unambiguous Auxiliary Pushdown Automata And - Semi-Unbounded Fan-In Circuits (Correct)
No context found.
Chandra, A. K., Kozen, D., and Stockmeyer, L. (1981). Alternation. Journal of the ACM, 28:114--133.
Computational Complexity of Plan and Controller Synthesis under.. - Rintanen (Correct)
No context found.
CHANDRA, A., KOZEN, D., AND STOCKMEYER, L. 1981. Alternation. J. ACM 28, 1, 114--133.
Complexity Theory - Allender, Loui, Regan (2004) (Correct)
No context found.
Chandra, A. K., Kozen, D. C., and Stockmeyer, L. J. 1981. Alternation. J. Assn. Comp. Mach. 28(1):114--133. 32
Focus Games for Satisfiability and Completeness of Temporal.. - Martin Lange Colin (2001) (1 citation) (Correct)
No context found.
Chandra, A., Kozen, D. and Stockmeyer, L. (1981). Alternation. Journal of ACM, 28, 114-133.
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