Wikipedia

Talk:ZPP (complexity)

This is an old revision of this page, as edited by Dcoetzee (talk | contribs) at 07:11, 24 May 2005. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Latest comment: 20 years ago by Dcoetzee in topic Wrong definition

Wrong definition

Latest comment: 20 years ago1 comment1 person in discussion

I think the definition is wrong on this page; machines recognizing languages in ZPP should always terminate in polynomial time, since machines recognizing languages in RP (and co-RP) do. This may be an alternate definition, but it's not consistent with the RP article. Can someone confirm this? Deco 20:17, 5 Nov 2004 (UTC)

  • There are two definitions: one in style of the RP article and this one. They are equivalent, some sources use one, some other. I will add the other definition to this article. Andris 22:44, Nov 5, 2004 (UTC)
Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:ZPP_(complexity)&oldid=16898358"