Rudolf Adamkovič Personal site

Up: Personal website   [Top][Contents]

NP

a.k.a. nondeterministic polynomial-time class

A complexity class of every decision problem whose

every solution is verifiable in polynomial time.
© 2024 Rudolf Adamkovič under GNU General Public License version 3.
Made with Emacs and the secret alien technologies of yesteryear.