Restricted Branching Programs with Parity-Type Augmentations-Lower Bounds and Algorithms.
Detlef SielingPublished in: ICALP Satellite Workshops (2000)
Keyphrases
- lower bound
- worst case
- objective function
- significant improvement
- times faster
- upper and lower bounds
- upper bound
- optimization problems
- computationally efficient
- decision trees
- online algorithms
- computational cost
- data structure
- online learning
- constraint satisfaction problems
- orders of magnitude
- learning algorithm
- noise tolerant