Personal website Rudolf Adamkovič

Home / Computer science


NP

A complexity class of every decision problem whose

every solution is verifiable in polynomial time.



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