Personal website Rudolf Adamkovič

Home / Computer science / NP-complete

Intuition

These are the hardest problems in NP because:

  1. By definition, all NP problems reduce to them.
  2. So, they are at least as hard as every problem in NP.
  3. So, they are the hardest problems in NP.
© 2025 Rudolf Adamkovič under GNU General Public License version 3.
Made with Emacs and secret alien technologies of yesteryear.