Lower Bounds for Pseudo-Deterministic Counting in a Stream.
Vladimir BravermanRobert KrauthgamerAditya KrishnanShay SapirPublished in: ICALP (2023)
Keyphrases
- lower bound
- randomized algorithms
- upper bound
- data streams
- branch and bound
- branch and bound algorithm
- np hard
- randomized algorithm
- objective function
- sliding window
- lower and upper bounds
- upper and lower bounds
- optimal solution
- worst case
- quadratic assignment problem
- database systems
- optimal cost
- incoming data
- randomly generated problems
- lower bounding
- stream processing
- memory efficient
- vc dimension
- streaming data
- black box
- theoretical analysis
- search algorithm