A superexponential lower bound for Gröbner bases and Church-Rosser commutative thue systems
DOI10.1016/S0019-9958(86)80035-3zbMATH Open0612.68033MaRDI QIDQ3753479FDOQ3753479
Publication date: 1986
Published in: Information and Control (Search for Journal in Brave)
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
cardinalitydegreeChurch-Rosser systemcommutative Thue systemGröbner basisdouble-exponential lower boundnormal form algorithmspolynomial ideal basisproduction length
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Thue and Post systems, etc. (03D03) Software, source code, etc. for problems pertaining to commutative algebra (13-04)
Cited In (15)
- A deterministic algorithm to decide if a finitely presented abelian monoid is cancellative
- Polly Two: a new algebraic polynomial-based public-key scheme
- Estimation under group actions: recovering orbits from invariants
- Complexity of Gröbner basis detection and border basis detection
- An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals, and applications to commutative semigroups
- Triangular sets for solving polynomial systems: a comparative implementation of four methods
- An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals
- Algebraic machine learning with an application to chemistry
- On the complexity of the \(F_5\) Gröbner basis algorithm
- Counting and Gröbner bases
- Degree bounds for Gröbner bases in algebras of solvable type
- A new lower bound construction for commutative Thue systems with applications
- The Church-Rosser property and special Thue systems
- A new method for solving algebraic systems of positive dimension
- On polynomial ideals, their complexity, and applications
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)
