Personal website Rudolf Adamkovič

Home / Computer science / Set cover


Complexity

The optimization and decision versions of set cover are

NP-hard and NP-complete

respectively.


© 2025 Rudolf Adamkovič under GNU General Public License version 3.
Made with Emacs and secret alien technologies of yesteryear.