Resolution with Counting: Dag-Like Lower Bounds and Different Moduli.
Fedor PartIddo TzameretPublished in: ITCS (2020)
Keyphrases
- lower bound
- upper bound
- directed acyclic graph
- branch and bound
- high resolution
- objective function
- np hard
- optimal solution
- lower and upper bounds
- branch and bound algorithm
- worst case
- learning theory
- max sat
- quadratic assignment problem
- lower bounding
- consequence finding
- image processing
- scheduling problem
- vc dimension
- computational complexity
- upper and lower bounds
- image resolution