Pages that link to "Item:Q3835026"
From MaRDI portal
The following pages link to A New Pebble Game that Characterizes Parallel Complexity Classes (Q3835026):
Displaying 13 items.
- Positive and negative proofs for circuits and branching programs (Q896677) (← links)
- Speedups of deterministic machines by synchronous parallel machines (Q1074339) (← links)
- The complexity of short two-person games (Q1173637) (← links)
- Properties that characterize LOGCFL (Q1176109) (← links)
- Non-commutative arithmetic circuits: depth reduction and size lower bounds (Q1274913) (← links)
- Speedup of determinism by alternation for multidimensional Turing machines (Q1341727) (← links)
- Functions computable in polynomial space (Q1775891) (← links)
- Succinct certification of monotone circuits (Q2232601) (← links)
- Two dynamic programming algorithms for which interpreted pebbling helps (Q2277375) (← links)
- Monomials in arithmetic circuits: complete problems in the counting hierarchy (Q2353185) (← links)
- Characterizing Valiant's algebraic complexity classes (Q2479314) (← links)
- Pebbling dynamic graphs in minimal space (Q4365023) (← links)
- Rounds versus time for the two person pebble game (Q5096183) (← links)
