A nonlinear lower bound for random-access machines under logarithmic cost.
Arnold SchönhagePublished in: J. ACM (1988)
Keyphrases
- random access
- random accesses
- lower bound
- worst case
- solid state
- disk storage
- upper bound
- multiview video coding
- external memory
- memory size
- flash memory
- objective function
- minimum cost
- branch and bound algorithm
- processing elements
- regret bounds
- hard disk
- np hard
- optimal solution
- database
- low complexity
- branch and bound
- response time
- wavelet transform