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

DOI10.1016/0020-0190(94)00106-5zbMATH Open0821.68064OpenAlexW1973275916MaRDI QIDQ1336772FDOQ1336772

Authors: 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

Recommendations

• On the robust hardness of Gröbner basis computation
• scientific article; zbMATH DE number 3857248
• On the complexity of Gröbner bases conversion
• Structural Gröbner basis detection
• Probabilistic analysis on Macaulay matrices over finite fields and complexity of constructing Gröbner bases

zbMATH Keywords

computational complexityanalysis of algorithmsGröbner basis

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (6)

• Complexity of Gröbner basis detection and border basis detection
• Computing Chevalley bases in small characteristics
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the complexity of the ℰ2 Grzegorczyk class
• On the robust hardness of Gröbner basis computation

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

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