Login / Signup
Hardness and inapproximability of convex recoloring problems.
Manoel B. Campêlo
Cristiana G. Huiban
Rudini M. Sampaio
Yoshiko Wakabayashi
Published in:
Theor. Comput. Sci. (2014)
Keyphrases
</>
artificial intelligence
computational complexity
np complete
learning theory
problems involving
convex relaxation
data mining
reinforcement learning
multi agent
multi class
information theoretic
approximation algorithms
solving problems
np hardness
convex programming
convex programs