Pages that link to "Item:Q1074339"
From MaRDI portal
The following pages link to Speedups of deterministic machines by synchronous parallel machines (Q1074339):
Displaying 17 items.
- A generalization of Spira's theorem and circuits with small segregators or separators (Q342721) (← links)
- On uniformity and circuit lower bounds (Q488049) (← links)
- On nondeterminism in parallel computation (Q1099612) (← links)
- The complexity of short two-person games (Q1173637) (← links)
- Deterministic versus nondeterministic space in terms of synchronized alternating machines (Q1334670) (← links)
- Speedup of determinism by alternation for multidimensional Turing machines (Q1341727) (← links)
- The size and depth of layered Boolean circuits (Q1944075) (← links)
- Two dynamic programming algorithms for which interpreted pebbling helps (Q2277375) (← links)
- Pebbling meets coloring: reversible pebble game on trees (Q2409574) (← links)
- Parallelizing time with polynomial circuits (Q2429726) (← links)
- Rounds versus time for the two person pebble game (Q2641235) (← links)
- A Generalization of Spira’s Theorem and Circuits with Small Segregators or Separators (Q2891374) (← links)
- Reversible Pebble Game on Trees (Q3196374) (← links)
- On time versus space III (Q3745280) (← links)
- Cumulative Space in Black-White Pebbling and Resolution (Q4638091) (← links)
- Alternating time versus deterministic time: A separation (Q4717057) (← links)
- Rounds versus time for the two person pebble game (Q5096183) (← links)