The following pages link to Alternation (Q3928246):
Displaying 50 items.
- Alternating simple multihead finite automata (Q1058853) (← links)
- Space-bounded hierarchies and probabilistic computations (Q1062759) (← links)
- Alternating multicounter machines with constant number of reversals (Q1067412) (← links)
- On the power of alternation in automata theory (Q1068537) (← links)
- Games against nature (Q1069296) (← links)
- Speedups of deterministic machines by synchronous parallel machines (Q1074339) (← links)
- Complete problems in the first-order predicate calculus (Q1075318) (← links)
- An introduction to parallelism in combinatorial optimization (Q1076605) (← links)
- Alternating tree automata (Q1077932) (← links)
- A theory for nondeterminism, parallelism, communication, and concurrency (Q1081296) (← links)
- On the construction of parallel computers from various basis of Boolean functions (Q1083204) (← links)
- Alternating on-line Turing machines with only universal states and small space bounds (Q1083207) (← links)
- Alternation and \(\omega\)-type Turing acceptors (Q1088417) (← links)
- On the complexity of theories of permutations (Q1088647) (← links)
- Concurrent program schemes and their logics (Q1094866) (← links)
- Comparison of the power between reversal-bounded ATMs and reversal- bounded NTMs (Q1094877) (← links)
- Array processing machines: an abstract model (Q1094879) (← links)
- Communication in concurrent dynamic logic (Q1095653) (← links)
- Balance of many-valued transductions and equivalence problems (Q1095671) (← links)
- Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states (Q1096388) (← links)
- Some observations concerning alternating Turing machines using small space (Q1097697) (← links)
- Alternating automata on infinite trees (Q1098325) (← links)
- On nondeterminism in parallel computation (Q1099612) (← links)
- Finite automata and unary languages (Q1099644) (← links)
- The problem of space invariance for sequential machines (Q1102112) (← links)
- On reversal bounded alternating Turing machines (Q1102114) (← links)
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes (Q1106840) (← links)
- The complexity of optimization problems (Q1107309) (← links)
- Parallel computation with threshold functions (Q1107324) (← links)
- Decompositions of nondeterministic reductions (Q1108263) (← links)
- \(\Sigma_ 2SPACE(n)\) is closed under complement (Q1108795) (← links)
- Relativized alternation and space-bounded computation (Q1111024) (← links)
- On the complexity of deciding fair termination of probabilistic concurrent finite-state programs (Q1111384) (← links)
- Some subclasses of context-free languages in \(NC^ 1\) (Q1112610) (← links)
- Subclasses of Presburger arithmetic and the polynomial-time hierarchy (Q1115858) (← links)
- Dominoes and the complexity of subclasses of logical theories (Q1115859) (← links)
- The computational complexity of asymptotic problems. I: Partial orders (Q1115860) (← links)
- Alternating multihead finite automata (Q1116353) (← links)
- Complexity theory of parallel time and hardware (Q1116695) (← links)
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\) (Q1117696) (← links)
- Tradeoffs for language recognition on alternating machines (Q1117697) (← links)
- With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy (Q1118405) (← links)
- The logarithmic alternation hierarchy collapses: \(A\Sigma _ 2^{{\mathcal L}}=A\Pi_ 2^{{\mathcal L}}\) (Q1118407) (← links)
- The complexity of reasoning about knowledge and time. I: Lower bounds (Q1119565) (← links)
- A hierarchy of propositional Horn formuls (Q1122571) (← links)
- Descriptive characterizations of computational complexity (Q1123616) (← links)
- A grammatical characterization of alternating pushdown automata (Q1123637) (← links)
- Efficient simulations of simple models of parallel computation by time- bounded ATMs and space-bounded TMs (Q1124332) (← links)
- Lower bounds for language recognition on two-dimensional alternating multihead machines (Q1124335) (← links)
- Speeding up inferences using relevance reasoning: a formalism and algorithms (Q1127352) (← links)
