The following pages link to Alternation (Q3928246):
Displaying 50 items.
- Deterministic versus nondeterministic space in terms of synchronized alternating machines (Q1334670) (← links)
- Hardness vs randomness (Q1337458) (← links)
- Classification of the index sets of low \([n]^ p\) and high \([n]^ p\) (Q1337641) (← links)
- Speedup of determinism by alternation for multidimensional Turing machines (Q1341727) (← links)
- Complexity results for two-way and multi-pebble automata and their logics (Q1349896) (← links)
- A remark on middle space bounded alternating Turing machines (Q1350303) (← links)
- The complexity of PDL with interleaving (Q1351943) (← links)
- Computational complexity and constraint logic programming languages (Q1354033) (← links)
- Expressing uniformity via oracles (Q1361886) (← links)
- Separating classes in the exponential-time hierarchy from classes in PH (Q1365687) (← links)
- Null inclusion dependencies in relational databases (Q1370653) (← links)
- On parallel hierarchies and \(R_k^i\) (Q1377627) (← links)
- Common knowledge and update in finite environments (Q1383157) (← links)
- A canonical form of vector machines (Q1383713) (← links)
- Gap-languages and log-time complexity classes (Q1389651) (← links)
- On the power of alternation on reversal-bounded alternating Turing machines with a restriction (Q1390864) (← links)
- Alternation on cellular automata (Q1390871) (← links)
- Nondeterministic stack register machines (Q1391527) (← links)
- On the parallel complexity of loops (Q1391751) (← links)
- Deterministic summation modulo \(\mathcal B_{n}\), the semigroup of binary relations on \(0,1, \dots, n-1\) (Q1392020) (← links)
- Typechecking for XML transformers (Q1394797) (← links)
- Decision procedures for inductive Boolean functions based on alternating automata (Q1399969) (← links)
- From bidirectionality to alternation. (Q1401248) (← links)
- Introduction to computability logic (Q1408853) (← links)
- Generalized acceptance, succinctness and supernondeterministic finite automata. (Q1426171) (← links)
- Time-space tradeoffs for satisfiability (Q1567402) (← links)
- A complexity analysis of bisimilarity for value-passing processes (Q1575255) (← links)
- Symbolic model checking for \(\mu\)-calculus requires exponential time (Q1575656) (← links)
- Alternating finite automata and star-free languages (Q1575674) (← links)
- Efficient implementation of regular languages using reversed alternating finite automata (Q1575901) (← links)
- Decision algorithms for multiplayer noncooperative games of incomplete information (Q1609052) (← links)
- Alternating weighted automata over commutative semirings (Q1637338) (← links)
- Fuzzy alternating Büchi automata over distributive lattices (Q1678419) (← links)
- Conjunctive query containment over trees using schema information (Q1702301) (← links)
- On the descriptional complexity of stateless deterministic ordered restarting automata (Q1706159) (← links)
- On the complexity of the quantified bit-vector arithmetic with binary encoding (Q1708270) (← links)
- The complexity of synchronizing Markov decision processes (Q1740670) (← links)
- Weak bisimilarity and regularity of context-free processes is EXPTIME-hard (Q1763731) (← links)
- Finite graph automata for linear and boundary graph languages (Q1770387) (← links)
- Randomized proofs in arithmetic (Q1807460) (← links)
- A note on two-dimensional probabilistic Turing machines (Q1818955) (← links)
- Domino-tiling games (Q1822501) (← links)
- A leaf-time hierarchy of two-dimensional alternating turing machines (Q1822969) (← links)
- Probabilistic game automata (Q1824400) (← links)
- Some remarks on the alternating hierarchy and closure under complement for sublogarithmic space (Q1825656) (← links)
- Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete. (Q1853560) (← links)
- Alternation and bounded concurrency are reverse equivalent. (Q1854297) (← links)
- Pushdown processes: Games and model-checking (Q1854405) (← links)
- How hard is computing the edit distance? (Q1854409) (← links)
- On the complexity of verifying concurrent transition systems (Q1854510) (← links)
