Lower Bounds for Pseudo-Deterministic Counting in a Stream.
Vladimir BravermanRobert KrauthgamerAditya KrishnanShay SapirPublished in: CoRR (2023)
Keyphrases
- lower bound
- randomized algorithms
- upper bound
- data streams
- randomized algorithm
- objective function
- branch and bound
- branch and bound algorithm
- real time
- np hard
- lower bounding
- optimal solution
- lower and upper bounds
- upper and lower bounds
- sliding window
- vc dimension
- stream data
- worst case
- quadratic assignment problem
- randomly generated problems
- dynamic programming
- black box
- special case