The following pages link to Alternation (Q3928246):
Displaying 50 items.
- Unambiguous computations and locally definable acceptance types (Q1127545) (← links)
- A communication hierarchy of parallel computations (Q1129258) (← links)
- Three-dimensional alternating Turing machines with only universal states (Q1129412) (← links)
- On alternation (Q1141480) (← links)
- Tree-size bounded alternation (Q1145502) (← links)
- An extension of Savitch's theorem to small space bounds (Q1151259) (← links)
- On uniform circuit complexity (Q1152951) (← links)
- On the computational complexity of satisfiability in propositional logics of programs (Q1170028) (← links)
- The complexity of short two-person games (Q1173637) (← links)
- Properties that characterize LOGCFL (Q1176109) (← links)
- On the computational efficiency of symmetric neural networks (Q1176243) (← links)
- Separating the eraser Turing machine classes \(L_ e\), \(NL_ e\), \(co- NL_ e\) and \(P_ e\) (Q1178711) (← links)
- A note on the space complexity of some decision problems for finite automata (Q1183428) (← links)
- Iterated stack automata and complexity classes (Q1183602) (← links)
- Some properties of space-bounded synchronized alternating Turing machines with universal states only (Q1184994) (← links)
- The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems (Q1185244) (← links)
- The complexity of stochastic games (Q1187025) (← links)
- Decision problems for propositional linear logic (Q1192352) (← links)
- A survey of space complexity (Q1193412) (← links)
- A guide to completeness and complexity for modal logics of knowledge and belief (Q1193476) (← links)
- Polynomial-time 1-Turing reductions from \(\#\)PH to \(\#\)P (Q1193633) (← links)
- Generalizations of Opt P to the polynomial hierarchy (Q1193867) (← links)
- Alternating automata, the weak monadic theory of trees and its complexity (Q1193871) (← links)
- Upper bounds on recognition of a hierarchy of non-context-free languages (Q1193884) (← links)
- On space-bounded synchronized alternating Turing machines (Q1193901) (← links)
- A characterization of exponential-time languages by alternating context- free grammars (Q1193905) (← links)
- Intersection and union of regular languages and state complexity (Q1199879) (← links)
- A relationship between nondeterministic turing machines and 1-inkdot turing machines with small space (Q1199887) (← links)
- A uniform approach to define complexity classes (Q1200807) (← links)
- Positional simulation of two-way automata: Proof of a conjecture of R. Kannan and generalizations (Q1201150) (← links)
- Trade-offs between communication and space (Q1201877) (← links)
- Complexity of logical theories involving coprimality (Q1202924) (← links)
- Communication for alternating machines (Q1203600) (← links)
- Unambiguity of circuits (Q1208408) (← links)
- Circuit size relative to pseudorandom oracles (Q1208410) (← links)
- A note on realtime one-way synchronized alternating one-counter automata (Q1208731) (← links)
- On the complexity of tree embedding problems (Q1209372) (← links)
- On determining optimal strategies in pursuit games in the plane (Q1269731) (← links)
- Reflective relational machines (Q1271557) (← links)
- Properties of probabilistic pushdown automata (Q1274989) (← links)
- Positive versions of polynomial time (Q1281503) (← links)
- A note on two-dimensional probabilistic finite automata (Q1298347) (← links)
- Succinctness as a source of complexity in logical formalisms (Q1302307) (← links)
- A note on three-dimensional alternating Turing machines with space smaller than \(\log m\) (Q1310925) (← links)
- The Othello game on an \(n\times n\) board is PSPACE-complete (Q1314386) (← links)
- The state complexities of some basic operations on regular languages (Q1318694) (← links)
- Nondeterminacy and recursion via stacks and games (Q1318704) (← links)
- On 1-inkdot alternating Turing machines with small space (Q1325841) (← links)
- Simulation of three-dimensional one-marker automata by five-way Turing machines (Q1328532) (← links)
- The complexity of optimizing finite-state transducers (Q1329734) (← links)
