A Divide and Conquer Method to Compute Binomial Ideals

DOI10.1007/978-3-642-54423-1_56zbMath1405.68457OpenAlexW278612959MaRDI QIDQ5405080

Deepanjan Kesh, Shashank K. Mehta

Publication date: 31 March 2014

Published in: LATIN 2014: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-54423-1_56

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

This page was built for publication: A Divide and Conquer Method to Compute Binomial Ideals