Rudy’s OBTF Rudolf Adamkovič

Home / Computer science


NP-hard

The complexity class of problems

to which every NP problem reduces

in polynomial time.



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