Failure of Feasible Disjunction Property for k-DNF Resolution and NP-Hardness of Automating It.
Michal GarlíkPublished in: CCC (2024)
Keyphrases
- np hardness
- np hard
- approximation algorithms
- worst case analysis
- mixed integer
- boolean functions
- discrete tomography
- learning algorithm
- special case
- uniform distribution
- computational complexity
- linear program
- membership queries
- feasible solution
- parameter estimation
- linear programming
- scheduling problem
- data points
- optimal solution
- reinforcement learning