A superexponential lower bound for Gröbner bases and Church-Rosser commutative thue systems
From MaRDI portal
Publication:3753479
Recommendations
- A new lower bound construction for commutative Thue systems with applications
- scientific article; zbMATH DE number 1254276
- Some Complexity Results for Prefix Gröbner Bases in Free Monoid Rings
- Some complexity results for prefix Gröbner bases in free monoid rings
- scientific article; zbMATH DE number 2102751
Cited in
(18)- Algebraic machine learning with an application to chemistry
- A new method for solving algebraic systems of positive dimension
- Polly Two: a new algebraic polynomial-based public-key scheme
- An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals
- Counting and Gröbner bases
- The Church-Rosser property and special Thue systems
- Degree bounds for Gröbner bases in algebras of solvable type
- Complexity of Gröbner basis detection and border basis detection
- A deterministic algorithm to decide if a finitely presented abelian monoid is cancellative
- Some Complexity Results for Prefix Gröbner Bases in Free Monoid Rings
- Some complexity results for prefix Gröbner bases in free monoid rings
- A new lower bound construction for commutative Thue systems with applications
- On polynomial ideals, their complexity, and applications
- Triangular sets for solving polynomial systems: a comparative implementation of four methods
- Estimation under group actions: recovering orbits from invariants
- An Exponential Lower Bound for Prefix Gröbner Bases in Free Monoid Rings
- An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals, and applications to commutative semigroups
- On the complexity of the \(F_5\) Gröbner basis algorithm
This page was built for publication: A superexponential lower bound for Gröbner bases and Church-Rosser commutative thue systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3753479)
