The NP-hardness of finding a directed acyclic graph for regular resolution.

Samuel R. Buss Jan Hoffmann

Published in: Theor. Comput. Sci. (2008)

Keyphrases

np hardness
np hard
worst case analysis
approximation algorithms
mixed integer
lower bound
high resolution
discrete tomography
training data
computational complexity