On the Complexity of Linear Algebra Operations over Algebraic Extension Fields

DOI10.1007/978-3-031-41724-5_8MaRDI QIDQ6496600

Daniel A. Lichtblau, Amir Hashemi

Publication date: 3 May 2024

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relaxed Hensel lifting of triangular sets
• Fast arithmetic for triangular sets: from theory to practice
• On an installation of Buchberger's algorithm
• The membership problem for unmixed polynomial ideals is solvable in single exponential time
• On fast multiplication of polynomials over arbitrary algebras
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• Converting bases with the Gröbner walk
• On the walk
• Intrinsic complexity for constructing zero-dimensional Gröbner bases
• Accelerated tower arithmetic
• Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
• Inversion Modulo Zero-Dimensional Regular Chains
• Computing Minimal Polynomials of Matrices
• Powers of tensors and fast matrix multiplication
• Applications of strong Grobner bases over Euclidean domains
• An Efficient Implementation for Computing Gröbner Bases over Algebraic Number Fields

This page was built for publication: On the Complexity of Linear Algebra Operations over Algebraic Extension Fields