Rudy’s OBTF
Rudolf Adamkovič
Home
/
Computer science
/
NP-complete
Symbolic definition
\begin{equation*} L \in \text{NP-complete} \> \iff \> ( L \in \text{NP} ) \land ( L \in \text{NP-hard} ) \end{equation*}
© 2025
Rudolf Adamkovič
under
GNU General Public License (GPL)
version 3 or later.
Made with
Emacs
and secret alien technologies of yesteryear.