Resolution with Counting: Dag-Like Lower Bounds and Different Moduli.
Fedor PartIddo TzameretPublished in: Comput. Complex. (2021)
Keyphrases
- lower bound
- upper bound
- objective function
- branch and bound algorithm
- lower and upper bounds
- directed acyclic graph
- low resolution
- high resolution
- branch and bound
- np hard
- quadratic assignment problem
- image processing
- consequence finding
- optimal cost
- lower bounding
- worst case
- np complete
- scheduling problem
- data structure
- e learning