Rudy’s OBTF
Rudolf Adamkovič
Home
/
Computer science
NP-complete
A
complexity class
of problems that are
both
NP
and
NP-hard
.
Intuition
Symbolic definition
Proofs
Discovery
Synonyms
© 2025
Rudolf Adamkovič
under
GNU General Public License (GPL)
version 3 or later.
Made with
Emacs
and secret alien technologies of yesteryear.