Sciweavers

3 search results - page 1 / 1
» aaecc 2000
Sort
View
AAECC
2000
Springer
81views Algorithms» more  AAECC 2000»
13 years 4 months ago
On Short Multiplications and Divisions
Computing only the low degree terms of the product of two univariate polynomials is called a short multiplication. By decomposition into subproblems, a short multiplication can be ...
Thom Mulders
AAECC
2006
Springer
133views Algorithms» more  AAECC 2006»
13 years 4 months ago
The Berlekamp-Massey Algorithm revisited
We propose a slight modification of the Berlekamp-Massey Algorithm for obtaining the minimal polynomial of a given linearly recurrent sequence. Such a modification enables to expl...
Nadia Ben Atti, Gema M. Diaz-Toca, Henri Lombardi
AAECC
2010
Springer
114views Algorithms» more  AAECC 2010»
13 years 5 months ago
Termination of narrowing via termination of rewriting
Abstract Narrowing extends rewriting with logic capabilities by allowing logic variables in terms and by replacing matching with unification. Narrowing has been widely used in diff...
Naoki Nishida, Germán Vidal