The following pages link to Alternation (Q3928246):
Displaying 50 items.
- The complexity of one-agent refinement modal logic (Q744988) (← links)
- Constructive modal logics. I (Q750417) (← links)
- Turing machines with access to history (Q751802) (← links)
- Some classes of languages in \(NC^ 1\) (Q756426) (← links)
- Prediction-preserving reducibility (Q756441) (← links)
- Fuzzy alternating automata over distributive lattices (Q781276) (← links)
- A note on alternating on-line Turing machines (Q789181) (← links)
- Bandwidth constraints on problems complete for polynomial time (Q791316) (← links)
- Turing machines with linear alternation, theories of bounded concatenation and the decision problem of first order theories (Q793017) (← links)
- Two-dimensional alternative Turing machines (Q794169) (← links)
- Alternating finite automata on \(\omega\)-words (Q796990) (← links)
- The complexity of two-player games of incomplete information (Q800838) (← links)
- The complexity of the satisfiability problem for Krom formulas (Q800915) (← links)
- Results on the propositional \(\mu\)-calculus (Q801893) (← links)
- Global and local views of state fairness (Q804304) (← links)
- Pseudorandom bits for constant depth circuits (Q808707) (← links)
- Nonuniform proof systems: A new framework to describe nonuniform and probabilistic complexity classes (Q809600) (← links)
- A note on real-time one-way alternating multicounter machines (Q809610) (← links)
- On the power of synchronization in parallel computations (Q811118) (← links)
- Collecting statistics over runtime executions (Q812051) (← links)
- Computation of equilibria in noncooperative games (Q815274) (← links)
- A note on alternating one-pebble Turing machines with sublogarithmic space (Q844190) (← links)
- State explosion in almost-sure probabilistic reachability (Q846015) (← links)
- On the complexity of the two-variable guarded fragment with transitive guards (Q859827) (← links)
- Deciding Boolean algebra with Presburger arithmetic (Q861705) (← links)
- Weighted hypertree decompositions and optimal query plans (Q878759) (← links)
- On attribute grammars without attribute synthesis (Q911787) (← links)
- Hypothetical datalog: Complexity and expressibility (Q915436) (← links)
- Satisfiability of formulae with one \(\forall\) is decidable in exponential time (Q915716) (← links)
- On the complexity of 1-tape ATMs and off-line 1-tape ATMs running in constant reversals (Q917283) (← links)
- One-way globally deterministic synchronized alternating finite automata recognize exactly deterministic context-sensitive languages (Q917319) (← links)
- A uniform method for proving lower bounds on the computational complexity of logical theories (Q917543) (← links)
- Polynomial size \(\Omega\)-branching programs and their computational power (Q918199) (← links)
- 0-1 laws and decision problems for fragments of second-order logic (Q920075) (← links)
- Deductive verification of alternating systems (Q939163) (← links)
- Proof synthesis and reflection for linear arithmetic (Q945055) (← links)
- A finite set of functions with an EXPTIME-complete composition problem (Q955009) (← links)
- More concise representation of regular languages by automata and regular expressions (Q963066) (← links)
- Pushdown module checking (Q968362) (← links)
- Conformant plans and beyond: principles and complexity (Q969534) (← links)
- Alternating states for dual nondeterminism in imperative programming (Q974118) (← links)
- Reachability on prefix-recognizable graphs (Q975403) (← links)
- Group announcement logic (Q975877) (← links)
- Note on winning positions on pushdown games with \(\omega\)-regular conditions (Q1007544) (← links)
- Verifying minimum stable circuit values (Q1007566) (← links)
- Hardness of equivalence checking for composed finite-state systems (Q1015390) (← links)
- Optical computing (Q1036535) (← links)
- On input-revolving deterministic and nondeterministic finite automata (Q1041031) (← links)
- Theory of one-tape linear-time Turing machines (Q1041220) (← links)
- Solitaire automata (Q1058475) (← links)
