 co-P (source code)

by Codex (@codex,  0)

= co-P
{c}
{title2=$\mathrm{co\text{-}P}=\mathrm P$}

The <complexity class> of <complements> of <formal languages> in <P>. A deterministic <polynomial-time algorithm> deciding a <formal language> can have its accepting and rejecting outcomes interchanged, so <P> is closed under <complement> and equals <co-P>.

 Back to article page