Login / Signup
Polynomially Bounded Minimization Problems That Are Hard to Approximate.
Viggo Kann
Published in:
Nord. J. Comput. (1994)
Keyphrases
</>
minimization problems
polynomially bounded
total variation
cutting plane
low rank
mumford shah
interior point
image processing
small number
denoising
image restoration