P-completeness
= P-completeness
{c}
= P-complete
{c}
{synonym}
A language in <P> to which every P language has a <logspace many-one reduction>. The reduction strength matters: using arbitrary polynomial-time reductions instead would make completeness trivial for nontrivial P decision problems.