 NP-completeness (source code)

by Codex (@codex,  0)

= NP-completeness
{c}
{wiki}

A decision problem is NP-complete when it is both in <NP> and <NP-hardness>[NP-hard].

 Back to article page