Image de couverture de livre

Faster modular composition using two relation matrices

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Neiger, Vincent, Salvy, Bruno, Schost, Éric, Villard, Gilles
Format:	Preprint
Publié:	2026
Sujets:	Symbolic Computation
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Computing Krylov iterates in the time of matrix multiplication
par: Neiger, Vincent, et autres
Publié: (2024)

Faster List Decoding of AG Codes
par: Beelen, Peter, et autres
Publié: (2023)

Matrices with displacement structure: a deterministic approach for linear systems and nullspace bases
par: Khichane, Sara, et autres
Publié: (2026)

Computing submatrices of the Hermite normal form of a structured polynomial matrix
par: Berthomieu, Jérémy, et autres
Publié: (2026)

Positivity Proofs for Linear Recurrences through Contracted Cones
par: Ibrahim, Alaa, et autres
Publié: (2024)

Hilbert's Nullstellensatz is in the Counting Hierarchy
par: Andrews, Robert, et autres
Publié: (2026)

A complexity analysis of the F4 Gröbner basis algorithm with tracer data
par: Kouba, Robin, et autres
Publié: (2026)

Optimized Gröbner basis algorithms for maximal determinantal ideals and critical point computations
par: Gopalakrishnan, Sriram, et autres
Publié: (2024)

Effective Quadratic Error Bounds for Floating-Point Algorithms Computing the Hypotenuse Function
par: Muller, Jean-Michel, et autres
Publié: (2024)

Computing roadmaps in unbounded smooth real algebraic sets II: algorithm and complexity
par: Prébet, Rémi, et autres
Publié: (2024)

A SageMath Package for Analytic Combinatorics in Several Variables: Beyond the Smooth Case
par: Hackl, Benjamin, et autres
Publié: (2025)

Refined bit complexity for the computation of at least onepoint per connected component of a smooth completeintersection real algebraic set
par: Elliott, Jesse, et autres
Publié: (2025)

Effective Asymptotics of Combinatorial Systems
par: Pivoteau, Carine, et autres
Publié: (2025)

Certification of the QR factor R, and of lattice basis reducedness
par: Villard, Gilles
Publié: (2007)

Faster multivariate integration in D-modules
par: Brochet, Hadrien, et autres
Publié: (2025)

More is Less: Adding Polynomials for Faster Explanations in NLSAT
par: Promies, Valentin, et autres
Publié: (2025)

Faster Inversion and Other Black Box Matrix Computations Using Efficient Block Projections
par: Eberly, Wayne, et autres
Publié: (2007)

A non-commutative algorithm for multiplying 4x4 matrices using 48 non-complex multiplications
par: Dumas, Jean-Guillaume, et autres
Publié: (2025)

Absolute root separation
par: Bugeaud, Yann, et autres
Publié: (2019)

Conditions for eigenvalue configurations of two real symmetric matrices (signature approach)
par: Hong, Hoon, et autres
Publié: (2023)

Conditions for eigenvalue configurations of two real symmetric matrices (symmetric polynomial approach)
par: Hong, Hoon, et autres
Publié: (2023)

In-place accumulation of fast multiplication formulae
par: Dumas, Jean-Guillaume, et autres
Publié: (2023)

Fast in-place accumulation
par: Dumas, Jean-Guillaume, et autres
Publié: (2023)

On the equivalence problem of Smith forms for multivariate polynomial matrices
par: Lu, Dong, et autres
Publié: (2024)

Computing Euler products and coefficients of classical modular forms for twisted L-functions
par: Molin, Pascal
Publié: (2025)

Algebraic Representations for Faster Predictions in Convolutional Neural Networks
par: Joyce, Johnny, et autres
Publié: (2024)

Fast polynomial computations with space constraints
par: Grenet, Bruno
Publié: (2025)

NoSQL Graph Databases: an overview
par: Santos, Veronica, et autres
Publié: (2024)

Solving parametric polynomial systems using Generic Rational Univariate Representation
par: Corniquel, Florent
Publié: (2026)

A more accurate rational non-commutative algorithm for multiplying 4x4 matrices using 48 multiplications
par: Dumas, Jean-Guillaume, et autres
Publié: (2026)

On deciding transcendence of power series
par: Bostan, Alin, et autres
Publié: (2025)

Modular composition & polynomial GCD in the border of small, shallow circuits
par: Andrews, Robert, et autres
Publié: (2025)

Faster Gröbner bases for Lie derivatives of ODE systems via monomial orderings
par: Bessonov, Mariya, et autres
Publié: (2022)

Fast interpolation and multiplication of unbalanced polynomials
par: Giorgi, Pascal, et autres
Publié: (2024)

On modular computation of Groebner bases with integer coefficients
par: Orevkov, S. Yu.
Publié: (2013)

Towards Practical Automatic Piano Reduction using BERT with Semi-supervised Learning
par: Wong, Wan Ki, et autres
Publié: (2025)

A Generalisation of Goursat's Algorithm for Integration in Finite Terms
par: Blake, Sam
Publié: (2026)

Avoiding Big Integers: Parallel Multimodular Algebraic Verification of Arithmetic Circuits
par: Hofstadler, Clemens, et autres
Publié: (2026)

Meta Flip Graph meets Serendipitous Product: new Fast Matrix Multiplication results
par: Perminov, A. I.
Publié: (2026)

Computational Explorations on Semifields
par: Dumas, Jean-Guillaume, et autres
Publié: (2026)