Personal website Rudolf Adamkovič

Home / Computer science / NP-complete


Proofs

To prove a problem \(L\) is NP-complete,

reduce a known NP-complete problem to \(L\).

in polynomial time.


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