z-logo
open-access-imgOpen Access
NP-hardness of $\ell$0 minimization problems: revision and extension to the non-negative setting
Author(s) -
Thi Nguyen,
Charles Soussen,
Jérôme Idier,
ElHadi Djermoune
Publication year - 2019
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - extension (predicate logic) , minification , algorithm , computer science , mathematics , combinatorics , mathematical optimization , programming language

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here