Thom Mulders
- 1.AHO, A. V., HOPCROFT, J. E., AND ULLMAN, J. D. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.]] Google Scholar
Digital Library
- 2.DOMICH, P. D., KANNAN, R., AND TROTTER, JR., L. E. Hermite normal form computation using modulo determinant arithmetic. Mathematics of Operations Research 12, 1 (1987), 50-59.]] Google ScholarDigital Library
- 3.GIESBRECHT, M. Fast computation of the Smith normal form of an integer matrix. In Proc. Int'l. Syrup. on Symbolic and Algebraic Computation: ISSAC '95 (1995), A. H. M. Levelt, Ed., pp. 110-118.]] Google ScholarDigital Library
- 4.IWANIEC, H. On the problem of Jacobsthal. Demonstratio Mathematica 11, 1 (1978), 225--231.]]Google ScholarCross Ref
- 5.JACOBSTHAL, E. /Jber Sequenzen ganzer Zahlen, von denen keine zu n teilerfremd ist I-III. Norske Vid. Selsk. Forhdl. 33 (1960), 117-124, 125-131, 132-139.]]Google Scholar
- 6.KALTOFEN, E., KRISHNAMOORTHY, M. S., AND SAUN- DERS, B. D. Fast parallel computation of Hermite and Smith forms of polynomial matrices. SIAM Journal of Algebraic and Discrete Methods 8 (1987), 683-690.]] Google ScholarDigital Library
- 7.KALTOFEN, E., KRISHNAMOORTHY, M. S., AND SAUN- DERS, B. D. Parallel algorithms for matrix normal forms. Linear Algebra and its Applications 136 (1990), 189-208.]]Google ScholarCross Ref
- 8.KANOLD, H.-J. /Jber eine zahlentheoretische Funktion von Jacobsthal. Math. Annalen 170 (1967), 314-326.]]Google ScholarCross Ref
- 9.STORJOHANN, A. A solution to the extended gcd problem with applications. In Proc. Int'l. Syrup. on Symbolic and Algebraic Computation: ISSAC '97 (1997).]] Google ScholarDigital Library
- 10.STORJOHANN, A., AND LABAHN, G. A fast Las Vegas algorithm for computing the Smith normal form of a polynomial matrix. Linear Algebra and its Applications 253 (1997), 155--173.]]Google ScholarCross Ref
- 11.STORJOHANN, A., AND MULDERS, T. Fast algorithms for linear algebra modulo N. To appear in Proc. of Sixth Ann. Europ. Symp. on Algorithms: ESA '98.]] Google ScholarDigital Library
- 12.VILLARD, G. Generalized subresultants for computing the Smith normal form of polynomial matrices. Journal of Symbolic Computation 20, 3 (1995), 269--286.]] Google ScholarDigital Library
- 13.VILLARD, G. Fast parallel algorithms for matrix reduction to normal forms. Applicable Algebra in Engineering, Communication and Control 8 (1997), 511--537.]]Google Scholar
Index Terms
- The modulo N extended GCD problem for polynomials
Recommendations
Computation of GCD of Sparse Multivariate Polynomials by Extended Hensel Construction
SYNASC '15: Proceedings of the 2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)Let F(x, u1, , ul) be a squarefree multivariate polynomial in main variable x and sub-variables u1, , ul. We say that the leading coefficient (LC) of F is singular if it vanishes at the origin of sub-variables. A representative algorithm for nonsparse ...
An extended GCD algorithm for parametric univariate polynomials and application to parametric smith normal form
ISSAC '20: Proceedings of the 45th International Symposium on Symbolic and Algebraic ComputationAn extended greatest common divisor (GCD) algorithm for parametric univariate polynomials is presented in this paper. This algorithm computes not only the GCD of parametric univariate polynomials in each constructible set but also the corresponding ...
The Complexity of the Extended GCD Problem
MFCS '99: Proceedings of the 24th International Symposium on Mathematical Foundations of Computer ScienceWe undertake a thorough complexity study of the following fundamental optimization problem, known as the lp-norm shortest extended GCD multiplier problem: given a1,...,an Z, find an lp-norm shortest gcd multiplier for a1,...,an, i.e., a vector x ∈ Zn ...
Comments