Pages that link to "Item:Q1117697"

The following pages link to Tradeoffs for language recognition on alternating machines (Q1117697):

Displaying 8 items.

• On the power of synchronization in parallel computations (Q811118) (← links)
• On the complexity of 1-tape ATMs and off-line 1-tape ATMs running in constant reversals (Q917283) (← links)
• Some properties of space-bounded synchronized alternating Turing machines with universal states only (Q1184994) (← links)
• Communication for alternating machines (Q1203600) (← links)
• Deterministic versus nondeterministic space in terms of synchronized alternating machines (Q1334670) (← links)
• On problems for which no oracle can help (Q3829070) (← links)
• (Q4016418) (← links)
• Lifting query complexity to time-space complexity for two-way finite automata (Q6141040) (← links)