The following pages link to On alternation (Q1141480):
Displaying 23 items.
- Amplifying circuit lower bounds against polynomial time, with applications (Q354644) (← links)
- Interactive proof systems and alternating time-space complexity (Q685437) (← links)
- A note on alternating on-line Turing machines (Q789181) (← links)
- Two-dimensional alternative Turing machines (Q794169) (← links)
- A note on real-time one-way alternating multicounter machines (Q809610) (← links)
- Theory of one-tape linear-time Turing machines (Q1041220) (← links)
- Alternating simple multihead finite automata (Q1058853) (← links)
- Speedups of deterministic machines by synchronous parallel machines (Q1074339) (← links)
- On the structure of one-tape nondeterministic Turing machine time hierarchy (Q1082813) (← links)
- Alternating on-line Turing machines with only universal states and small space bounds (Q1083207) (← links)
- On reversal bounded alternating Turing machines (Q1102114) (← links)
- Alternating real-time computations (Q1111386) (← links)
- Three-dimensional alternating Turing machines with only universal states (Q1129412) (← links)
- An NP-complete language accepted in linear time by a one-tape Turing machine (Q1183577) (← links)
- Communication for alternating machines (Q1203600) (← links)
- On 1-inkdot alternating Turing machines with small space (Q1325841) (← links)
- A leaf-time hierarchy of two-dimensional alternating turing machines (Q1822969) (← links)
- Constructions for alternating finite automata<sup>∗</sup> (Q3477972) (← links)
- 1998 European Summer Meeting of the Association for Symbolic Logic (Q4254644) (← links)
- Alternating time versus deterministic time: A separation (Q4717057) (← links)
- New time hierarchy results for deterministic TMS (Q5096792) (← links)
- Lower bounds for multiplayer noncooperative games of incomplete information (Q5948765) (← links)
- Computational complexity of puzzles and related topics (Q6535387) (← links)
