Lower bounds for samplers and data structures via the cell-probe separator.
Emanuele ViolaPublished in: Electron. Colloquium Comput. Complex. (2021)
Keyphrases
- lower bound
- data structure
- upper bound
- branch and bound algorithm
- lower and upper bounds
- efficient data structures
- bayesian inference
- random sampling
- branch and bound
- np hard
- gibbs sampler
- optimal solution
- upper and lower bounds
- markov chain monte carlo
- vc dimension
- suffix tree
- optimal cost
- database operations
- lower bounding
- objective function
- data types
- index structure
- worst case
- face recognition
- database systems
- microscopy images
- online learning
- simulated annealing
- randomly generated problems
- machine learning