New lower bounds for probabilistic degree and AC0 with parity gates.
Emanuele ViolaPublished in: Electron. Colloquium Comput. Complex. (2020)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- np hard
- objective function
- lower and upper bounds
- generative model
- branch and bound
- optimal solution
- upper and lower bounds
- probabilistic reasoning
- uncertain data
- data driven
- probabilistic model
- sample complexity
- probabilistic logic
- lower bounding
- worst case
- special case
- quadratic assignment problem