Login / Signup
Strong intractability of generalized convex recoloring problems.
Phablo F. S. Moura
Yoshiko Wakabayashi
Published in:
Electron. Notes Discret. Math. (2017)
Keyphrases
</>
np complete
problems involving
optimization problems
solving problems
quasiconvex
computer vision
objective function
computational complexity
convex programming
fractional programming