Computational Explorations on Semifields
Fuente:
arXiv
Saved in:
| Main Authors: | Dumas, Jean-Guillaume, Lia, Stefano, Sheekey, John |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
In-place accumulation of fast multiplication formulae
by: Dumas, Jean-Guillaume, et al.
Published: (2023)
by: Dumas, Jean-Guillaume, et al.
Published: (2023)
Fast in-place accumulation
by: Dumas, Jean-Guillaume, et al.
Published: (2023)
by: Dumas, Jean-Guillaume, et al.
Published: (2023)
A non-commutative algorithm for multiplying 4x4 matrices using 48 non-complex multiplications
by: Dumas, Jean-Guillaume, et al.
Published: (2025)
by: Dumas, Jean-Guillaume, et al.
Published: (2025)
Strassen's algorithm is not optimally accurate
by: Dumas, Jean-Guillaume, et al.
Published: (2024)
by: Dumas, Jean-Guillaume, et al.
Published: (2024)
Towards automated generation of fast and accurate algorithms for recursive matrix multiplication
by: Dumas, Jean-Guillaume, et al.
Published: (2025)
by: Dumas, Jean-Guillaume, et al.
Published: (2025)
A more accurate rational non-commutative algorithm for multiplying 4x4 matrices using 48 multiplications
by: Dumas, Jean-Guillaume, et al.
Published: (2026)
by: Dumas, Jean-Guillaume, et al.
Published: (2026)
Optimal Communication Unbalanced Private Set Union
by: Dumas, Jean-Guillaume, et al.
Published: (2024)
by: Dumas, Jean-Guillaume, et al.
Published: (2024)
Parallel Heuristic Exploration for Additive Complexity Reduction in Fast Matrix Multiplication
by: Perminov, A. I.
Published: (2025)
by: Perminov, A. I.
Published: (2025)
Software Portability for Computer Algebra
by: Norman, Arthur C., et al.
Published: (2025)
by: Norman, Arthur C., et al.
Published: (2025)
On the Computation of Newton Polytopes of Eliminants
by: Mohr, Rafael, et al.
Published: (2025)
by: Mohr, Rafael, et al.
Published: (2025)
Explorations on the number of realizations of minimally rigid graphs
by: Grasegger, Georg
Published: (2025)
by: Grasegger, Georg
Published: (2025)
Computing Krylov iterates in the time of matrix multiplication
by: Neiger, Vincent, et al.
Published: (2024)
by: Neiger, Vincent, et al.
Published: (2024)
Computing a holonomic submodule of the partial Weyl closure
by: Brochet, Hadrien
Published: (2026)
by: Brochet, Hadrien
Published: (2026)
On the scaling of random Tamari intervals and Schnyder woods of random triangulations (with an asymptotic D-finite trick)
by: Chapuy, Guillaume
Published: (2024)
by: Chapuy, Guillaume
Published: (2024)
Computing submatrices of the Hermite normal form of a structured polynomial matrix
by: Berthomieu, Jérémy, et al.
Published: (2026)
by: Berthomieu, Jérémy, et al.
Published: (2026)
Effective Quadratic Error Bounds for Floating-Point Algorithms Computing the Hypotenuse Function
by: Muller, Jean-Michel, et al.
Published: (2024)
by: Muller, Jean-Michel, et al.
Published: (2024)
An Algorithm for Computing the Leading Monomials of a Minimal Groebner Basis of Generic Sequences
by: Sakata, Kosuke, et al.
Published: (2025)
by: Sakata, Kosuke, et al.
Published: (2025)
Two Algorithms for Computing Rational Univariate Representations of Zero-Dimensional Ideals with Parameters
by: Wang, Dingkang, et al.
Published: (2024)
by: Wang, Dingkang, et al.
Published: (2024)
Computing greatest common divisor of several parametric univariate polynomials via generalized subresultant polynomials
by: Hong, Hoon, et al.
Published: (2023)
by: Hong, Hoon, et al.
Published: (2023)
Botfip-LLM: An Enhanced Multimodal Scientific Computing Framework Leveraging Knowledge Distillation from Large Language Models
by: Chen, Tianhao, et al.
Published: (2024)
by: Chen, Tianhao, et al.
Published: (2024)
First-order factors of linear Mahler operators
by: Chyzak, Frédéric, et al.
Published: (2024)
by: Chyzak, Frédéric, et al.
Published: (2024)
Sparse Tensors and Subdivision Methods for Finding the Zero Set of Polynomial Equations
by: Moroz, Guillaume
Published: (2024)
by: Moroz, Guillaume
Published: (2024)
Computing braids from approximate data
by: Guillemot, Alexandre, et al.
Published: (2026)
by: Guillemot, Alexandre, et al.
Published: (2026)
Green Computing: The Ultimate Carbon Destroyer for a Sustainable Future
by: Amiri, Sayed Mahbub Hasan, et al.
Published: (2025)
by: Amiri, Sayed Mahbub Hasan, et al.
Published: (2025)
Computing Clipped Products
by: Norman, Arthur C., et al.
Published: (2024)
by: Norman, Arthur C., et al.
Published: (2024)
Computing the connected components of real algebraic curves
by: Rocchi, Elisabetta, et al.
Published: (2026)
by: Rocchi, Elisabetta, et al.
Published: (2026)
Computing basis of solutions of any Mahler equation
by: Faverjon, Colin, et al.
Published: (2025)
by: Faverjon, Colin, et al.
Published: (2025)
Computing Isomorphisms between Products of Supersingular Elliptic Curves
by: Gaudry, Pierrick, et al.
Published: (2025)
by: Gaudry, Pierrick, et al.
Published: (2025)
Computing Certificates in Archimedean Univariate Saturated Quadratic Modules
by: Castellanos-Joo, Jose Abel, et al.
Published: (2026)
by: Castellanos-Joo, Jose Abel, et al.
Published: (2026)
Modular Algorithms For Computing Gröbner Bases in Free Algebras
by: Hofstadler, Clemens, et al.
Published: (2025)
by: Hofstadler, Clemens, et al.
Published: (2025)
Computing change of level and isogenies between abelian varieties
by: Dequay, Antoine, et al.
Published: (2025)
by: Dequay, Antoine, et al.
Published: (2025)
Computation of classical and $v$-adic $L$-series of $t$-motives
by: Caruso, Xavier, et al.
Published: (2024)
by: Caruso, Xavier, et al.
Published: (2024)
Computing Linear Regions in Neural Networks with Skip Connections
by: Joyce, Johnny, et al.
Published: (2025)
by: Joyce, Johnny, et al.
Published: (2025)
Computing a Group Action from the Class Field Theory of Imaginary Hyperelliptic Function Fields
by: Leudière, Antoine, et al.
Published: (2022)
by: Leudière, Antoine, et al.
Published: (2022)
Computational Algebra with Attention: Transformer Oracles for Border Basis Algorithms
by: Kera, Hiroshi, et al.
Published: (2025)
by: Kera, Hiroshi, et al.
Published: (2025)
Computing Characteristic Polynomials of p-Curvatures in Average Polynomial Time
by: Pagès, Raphaël
Published: (2021)
by: Pagès, Raphaël
Published: (2021)
Computing Generic Fibers of Polynomial Ideals with FGLM and Hensel Lifting
by: Berthomieu, Jérémy, et al.
Published: (2024)
by: Berthomieu, Jérémy, et al.
Published: (2024)
Towards Semantics Lifting for Scientific Computing: A Case Study on FFT
by: Zhang, Naifeng, et al.
Published: (2025)
by: Zhang, Naifeng, et al.
Published: (2025)
A Basis-preserving Algorithm for Computing the Bezout Matrix of Newton Polynomials
by: Yang, Jing, et al.
Published: (2024)
by: Yang, Jing, et al.
Published: (2024)
Computation of the Hilbert Series for the Support-Minors Modeling of the MinRank Problem
by: Bardet, Magali, et al.
Published: (2025)
by: Bardet, Magali, et al.
Published: (2025)
Similar Items
-
In-place accumulation of fast multiplication formulae
by: Dumas, Jean-Guillaume, et al.
Published: (2023) -
Fast in-place accumulation
by: Dumas, Jean-Guillaume, et al.
Published: (2023) -
A non-commutative algorithm for multiplying 4x4 matrices using 48 non-complex multiplications
by: Dumas, Jean-Guillaume, et al.
Published: (2025) -
Strassen's algorithm is not optimally accurate
by: Dumas, Jean-Guillaume, et al.
Published: (2024) -
Towards automated generation of fast and accurate algorithms for recursive matrix multiplication
by: Dumas, Jean-Guillaume, et al.
Published: (2025)