Geometric generality of transformer-based Gröbner basis computation
From MaRDI portal
Cites work
- A new efficient algorithm for computing Gröbner bases (F₄)
- A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases
- Advances in Cryptology - CRYPTO 2003
- Algorithmic aspects of Suslin's proof of Serre's conjecture
- Comprehensive Gröbner bases
- Computer algebra in systems biology
- Field Arithmetic
- Generic sequences of polynomials
- Gröbner bases and primary decomposition of polynomial ideals
- scientific article; zbMATH DE number 1703931 (Why is no real title available?)
- scientific article; zbMATH DE number 4132308 (Why is no real title available?)
- scientific article; zbMATH DE number 3572315 (Why is no real title available?)
- scientific article; zbMATH DE number 1206418 (Why is no real title available?)
- scientific article; zbMATH DE number 704831 (Why is no real title available?)
- scientific article; zbMATH DE number 2009966 (Why is no real title available?)
- scientific article; zbMATH DE number 3212889 (Why is no real title available?)
- Inverse kinematics and path planning of manipulator using real quantifier elimination based on Comprehensive Gr\"obner Systems
- On lattices, learning with errors, random linear codes, and cryptography
- ON THE STRUCTURE OF THE SPECIAL LINEAR GROUP OVER POLYNOMIAL RINGS
- The complexity of the word problems for commutative semigroups and polynomial ideals
- Topics in Cryptology – CT-RSA 2006
- Unbalanced Oil and Vinegar Signature Schemes
This page was built for publication: Geometric generality of transformer-based Gröbner basis computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7260580)
