The complexity of solving Weil restriction systems
From MaRDI portal
Publication:2689195
DOI10.1016/j.jalgebra.2023.01.008OpenAlexW4319991605MaRDI QIDQ2689195
Alessio Caminata, Michela Ceria, Elisa Gorla
Publication date: 9 March 2023
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.10506
Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25) Solving polynomial systems; resultants (13P15)
Cites Work
- An algebraic approach for decoding spread codes
- A criterion for detecting m-regularity
- Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
- An introduction to homological algebra
- Generic sequences of polynomials
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Solving degree, last fall degree, and related invariants
- Probabilistic analysis on Macaulay matrices over finite fields and complexity of constructing Gröbner bases
- Solving multivariate polynomial systems and an invariant from commutative algebra
- On the complexity of the \(F_5\) Gröbner basis algorithm
- Solving Degree and Degree of Regularity for Polynomial Systems over a Finite Fields
- Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
- The Geometry of Syzygies
- Pseudo-reductive Groups
- Semi-Regular Sequences and Other Random Systems of Equations
- The Complexity of MinRank
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The complexity of solving Weil restriction systems
