On the complexity of computing Gröbner bases in characteristic 2

DOI10.1016/0020-0190(94)00106-5zbMath0821.68064OpenAlexW1973275916MaRDI QIDQ1336772

Vincenzo Acciaro

Publication date: 3 November 1994

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00106-5

zbMATH Keywords

computational complexityGröbner basisanalysis of algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the complexity of computing Gröbner bases in characteristic 2