Sciweavers

AAECC
1995
Springer
137views Algorithms» more  AAECC 1995»
13 years 8 months ago
About Approximations of Exponentials
Abstract. We look for the approximation of exp(A1 + A2) by a product in form exp(x1A1) exp(y1A2) · · · exp(xnA1) exp(ynA2). We specially are interested in minimal approximations...
Pierre-Vincent Koseleff
AAECC
1995
Springer
86views Algorithms» more  AAECC 1995»
13 years 8 months ago
Isometry Classes of Indecomposable Linear Codes
Harald Fripertinger, Adalbert Kerber
AAECC
1995
Springer
92views Algorithms» more  AAECC 1995»
13 years 8 months ago
Division of Entire Functions by Polynomial Ideals
In [ASTW] it was given a Grobner reduction based division formula for entire functions by polynomial ideals. Here we give degree bounds where the input function can be truncated i...
Joachim Apel