Login / Signup
Failure of Feasible Disjunction Property for $k$-DNF Resolution and NP-hardness of Automating It.
Michal Garlík
Published in:
Electron. Colloquium Comput. Complex. (2020)
Keyphrases
</>
np hardness
np hard
approximation algorithms
worst case analysis
learning algorithm
boolean functions
uniform distribution
discrete tomography
mixed integer
search space
objective function
lower bound
feasible solution