Personal website Rudolf Adamkovič

Home / Computer science


Hardness

Relative complexity in terms of reductions, where

problem \(L\) is at least as hard as \(L'\)

if and only if

\begin{equation*} L' \leq_{\mathrm{R}} L, \end{equation*}

where \(R\) is the reduction type,

typically a polynomial-time reduction.


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