Computing in quotients of rings of integers (original) (raw)
Related papers
A polynomial time algorithm for computing the HNF of a module over the integers of a number field
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation - ISSAC '12, 2012
The F 4 -algorithm for Euclidean rings
Central European Journal of Mathematics
On the computation of the HNF of a module over the ring of integers of a number field
Journal of Symbolic Computation, 2017
On the genericity of the modular polynomial GCD algorithm
1999
On a modular algorithm for computing GCDs of polynomials over algebraic number fields
Proceedings of the international symposium on Symbolic and algebraic computation - ISSAC '94, 1994
An algorithm for primary decomposition in polynomial rings over the integers
Stefan Steidel, Gerhard Pfister, Afshan Sadiq, Sadiq Afshan
Central European Journal of Mathematics, 2011
Resultants over principal Artinian rings
ArXiv, 2020
A new computational approach to ideal theory in number fields
Foundations of Computational Mathematics, Vol. 13, No. 5, 729-762, 2013
2000
An Algorithm for the Quillen–Suslin Theorem for Quotients of Polynomial Rings by Monomial Ideals
Journal of Symbolic Computation, 2000
On Some Algebraic Properties of the Euclidean Algorithm with Applications to Real Life
A modular integer GCD algorithm
Journal of Algorithms, 2005
Journal of Symbolic Computation, 2010
Parallelization of Modular Algorithms
Stefan Steidel, Gerhard Pfister
Journal of Symbolic Computation, 2011
Direct division in factor rings
Electronics Letters, 2002
Multivariate polynomial products over modular rings using residue arithmetic
IEEE Transactions on Signal Processing, 1995
18th IEEE Symposium on Computer Arithmetic (ARITH '07), 2007
Efficient Algorithms for Finite mathbbZ\mathbb{Z}mathbbZ-Algebras
Groups, complexity, cryptology, 2024
The complexity of the Chinese Remainder Theorem
arXiv (Cornell University), 2023
Algorithms for Commutative Algebras Over the Rational Numbers
Foundations of Computational Mathematics, 2016
On the reduction in multiplicative complexity achieved by the polynomial residue number system
IEEE Transactions on Signal Processing, 1992
A new Euclidean division algorithm for residue number systems
Proceedings of International Conference on Application Specific Systems, Architectures and Processors: ASAP '96, 1996
Algorithms for the Computing Determinants in Commutative Rings
arXiv (Cornell University), 2017
Generic Linear Algebra and Quotient Rings in Maple
Rational simplification modulo a polynomial ideal
2006
Algorithms for the solution of systems of linear equations in commutative ring
ArXiv, 2017
On Efficient Sparse Integer Matrix Smith Normal Form Computations
Journal of Symbolic Computation, 2001
Computational complexity of some problems involving congruences on algebras
Theoretical Computer Science, 2002
Abstracts from the 20th Conference on Applications of Computer Algebra, ACA 2014
2014
Algorithms for the non-monic case of the sparse modular GCD algorithm
Proceedings of the 2005 international symposium on Symbolic and algebraic computation - ISSAC '05, 2005
Fast Computation of Smith Forms of Sparse Matrices Over Local Rings
Andy Novocin, B. Saunders, B. Saunders, David Saunders
Algebraic and Euclidean Lattices: Optimal Lattice Reduction and Beyond
ArXiv, 2019