Personal website Rudolf Adamkovič

Home / Computer science


NP

The complexity class of decision problems whose

all solutions are verifiable in polynomial time.



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