Pages that link to "Item:Q3579215"
From MaRDI portal
The following pages link to Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems (Q3579215):
Displaying 11 items.
- Text indexing with errors (Q925060) (← links)
- A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs (Q1007589) (← links)
- Quantum branching programs and space-bounded nonuniform quantum complexity (Q1779302) (← links)
- On the nonapproximability of Boolean functions by OBDDs and read-\(k\)-times branching programs (Q1854567) (← links)
- A hierarchy result for read-once branching programs with restricted parity nondeterminism (Q2566039) (← links)
- Computing (and Life) Is All about Tradeoffs (Q2848971) (← links)
- Finding the Median (Obliviously) with Bounded Space (Q3448777) (← links)
- Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs (Q4462678) (← links)
- Quadratic Time-Space Lower Bounds for Computing Natural Functions with a Random Oracle (Q5090435) (← links)
- Cell-probe lower bounds for the partial match problem (Q5917577) (← links)
- Lifting query complexity to time-space complexity for two-way finite automata (Q6141040) (← links)