Pages that link to "Item:Q3455560"
From MaRDI portal
The following pages link to Time-space trade-off lower bounds for randomized computation of decision problems (Q3455560):
Displayed 17 items.
- Limitations of incremental dynamic programming (Q517805) (← links)
- Polynomial-size binary decision diagrams for the exactly half-\(d\)-hyperclique problem reading each input bit twice (Q841618) (← links)
- A note on the decoding complexity of error-correcting codes (Q845843) (← links)
- A nondeterministic space-time tradeoff for linear codes (Q976097) (← links)
- Choice-memory tradeoff in allocations (Q990388) (← links)
- Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries (Q1629393) (← links)
- Quantum branching programs and space-bounded nonuniform quantum complexity (Q1779302) (← links)
- On multi-partition communication complexity (Q1886038) (← links)
- Element distinctness revisited (Q1993785) (← links)
- Tight time-space lower bounds for finding multiple collision pairs and their applications (Q2055617) (← links)
- Expanders and time-restricted branching programs (Q2378527) (← links)
- Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication (Q2508966) (← links)
- A hierarchy result for read-once branching programs with restricted parity nondeterminism (Q2566039) (← links)
- Finding the Median (Obliviously) with Bounded Space (Q3448777) (← links)
- Quadratic Time-Space Lower Bounds for Computing Natural Functions with a Random Oracle (Q5090435) (← links)
- Typically-correct derandomization for small time and space (Q5091759) (← links)
- (Q5121903) (← links)