AAECC
2008
Springer
14 years 27 days ago
2008
Springer
AAECC
2008
Springer
14 years 2 months ago
2008
Springer
In a previous article [14], we proved the existence of resolvent representations for regular differential ideals. The present paper provides practical algorithms for computing suc...
AAECC
2008
Springer
14 years 2 months ago
2008
Springer
Abstract. In this paper we show that the separable decomposition of a univariate polynomial can be computed in softly optimal time, in terms of the number of arithmetic operations ...
AAECC
2008
Springer
14 years 2 months ago
2008
Springer
We provide some guidelines for deriving new projective hash families of cryptographic interest. Our main building blocks are so called group action systems; we explore what propert...
AAECC
2008
Springer
14 years 2 months ago
2008
Springer
AAECC
2008
Springer
14 years 2 months ago
2008
Springer
We consider unary term rewriting, i.e., term rewriting with unary signatures where all function symbols are either unary or constants. Terms over such signatures can be transformed...