This article is rated Start-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | ||||||||||||||||||
|
The "close-to-universal" at the end of the description could do with further explanation, e.g. by linking to another article. -- Ralph Corderoy ( talk) 18:27, 18 November 2011 (UTC)
I found a paper with contact author Moran Tzafier that describes the algorithm in detail: http://www.cs.tau.ac.il/~liortzaf/papers/disc2008_submission_98.pdf
This article seems to say 2 contradictory things:
Which one is it? -- DavidCary ( talk) 22:49, 9 June 2023 (UTC)
This article is rated Start-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | ||||||||||||||||||
|
The "close-to-universal" at the end of the description could do with further explanation, e.g. by linking to another article. -- Ralph Corderoy ( talk) 18:27, 18 November 2011 (UTC)
I found a paper with contact author Moran Tzafier that describes the algorithm in detail: http://www.cs.tau.ac.il/~liortzaf/papers/disc2008_submission_98.pdf
This article seems to say 2 contradictory things:
Which one is it? -- DavidCary ( talk) 22:49, 9 June 2023 (UTC)