减少动态Gröbner基算法中线性规划的规模和数目
Reducing the size and number of linear programs in a dynamic Gröbner basis algorithm
摘要：
计算Gröbner基的动态算法已经有将近20年的历史了，但它似乎已经胎死腹中;除了两个最初的出版物外，没有发表后续文章。其中一个原因可能是，乍一看，增加的开销似乎超过了好处;该算法必须解决许多具有许多线性约束的线性规划。本文介绍了两种大幅度降低成本的方法，有效地解决了这一问题。
英文摘要：
The dynamic algorithm to compute a Gröbner basis is nearly twenty years old, yet it seems to have arrived stillborn; aside from two initial publications, there have been no published followups. One reason for this may be that, at first glance, the added overhead seems to outweigh the benefit; the algorithm must solve many linear programs with many linear constraints. This paper describes two methods of reducing the cost substantially, answering the problem effectively.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
