Talk:Complete (complexity)

Untitled
It seems to me that the sentence
 * For example, NP, co-NP, PLS, PPA all have complete problems, while RP, ZPP, BPP and TFNP do not have complete problems.

is not known to be true. If it were true, then we'd know that BPP is not P, for example. 18.241.3.124 (talk) 03:40, 13 December 2007 (UTC)