Some complexity results for prefix Gröbner bases in free monoid rings

DOI10.1016/j.tcs.2009.10.018zbMath1184.13080OpenAlexW2059860624MaRDI QIDQ846370

Andrea Sattler-Klein

Publication date: 9 February 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.10.018

zbMATH Keywords

algorithmscomputational complexityGröbner basesrewritingfree monoid rings

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Uses Software

• MRC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• MRC -- data structures and procedures for computing in monoid and group rings
• An introduction to commutative and noncommutative Gröbner bases
• Gröbner basis cryptosystems
• An Exponential Lower Bound for Prefix Gröbner Bases in Free Monoid Rings