Sciweavers

11 search results - page 3 / 3
» On Derandomizing Tests for Certain Polynomial Identities
Sort
View
CSCLP
2007
Springer
13 years 11 months ago
Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR
Abstract. The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR...
Thom W. Frühwirth