Rudolf Adamkovič
Personal site
Up:
Index of computer science
[
Top
]
[
Contents
]
NP
A
complexity class
of every
decision problem
whose
every solution is verifiable in polynomial time.
Synonyms
© 2024 Rudolf Adamkovič under
GNU General Public License
version 3.
Made with
Emacs
and
the
secret alien technologies of yesteryear.