Structural Gröbner basis detection

DOI10.1007/S002000050063MaRDI QIDQ1361004zbMATH OpenOpenAlexFDO

Authors Bernd Sturmfels, Markus Wiegelmann

Publication date 1997

Published in Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s002000050063

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42)

Recommendations

• Complexity of Gröbner basis detection and border basis detection
• Border basis detection is NP-complete
• On the robust hardness of Gröbner basis computation
• On the complexity of computing Gröbner bases in characteristic 2

Cited in

(4)

• On the complexity of computing Gröbner bases in characteristic 2
• Complexity of Gröbner basis detection and border basis detection
• Border basis detection is NP-complete
• Conditional Gröbner basis: Gröbner basis detection with parameters

This page was built for publication: Structural Gröbner basis detection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361004)