Rudolf Adamkovič Personal site

Up: NP-complete   [Top][Contents]

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.
© 2024 Rudolf Adamkovič under GNU General Public License version 3.
Made with Emacs and the secret alien technologies of yesteryear.