Tight Space Lower Bound for Pseudo-Deterministic Approximate Counting.
Ofer GrossmanMeghal GuptaMark SellkePublished in: CoRR (2023)
Keyphrases
- lower bound
- upper bound
- exact and approximate
- branch and bound
- exact solution
- branch and bound algorithm
- randomized algorithms
- worst case
- np hard
- search space
- upper and lower bounds
- lower and upper bounds
- optimal solution
- lower bounding
- objective function
- neural network
- high dimensional
- randomized algorithm
- database
- provide an upper bound
- higher dimensional
- black box
- low dimensional
- linear programming
- nearest neighbor