Tight Streaming Lower Bounds for Deterministic Approximate Counting.
Yichuan WangPublished in: CoRR (2024)
Keyphrases
- lower bound
- exact and approximate
- upper bound
- randomized algorithms
- exact solution
- branch and bound algorithm
- branch and bound
- data streams
- np hard
- provide an upper bound
- randomized algorithm
- lower and upper bounds
- objective function
- real time
- upper and lower bounds
- lower bounding
- streaming data
- optimal cost
- optimal solution
- black box
- worst case
- linear functions
- randomly generated problems
- streaming media
- sample complexity
- real time streaming
- linear programming relaxation
- search space
- data sets