Personal website Rudolf Adamkovič

Home / Computer science

NP-complete

A complexity class of problems that are

both NP and NP-hard.

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