A theoretical basis for the reduction of polynomials to canonical forms
ACM SIGSAM Bulletin
On implementing Buchberger's algorithm for Grobner bases
SYMSAC '86 Proceedings of the fifth ACM symposium on Symbolic and algebraic computation
Algorithm 628: An algorithm for constructing canonical bases of polynomial ideals
ACM Transactions on Mathematical Software (TOMS)
Using symbolic algebra in algorithmic level DSP synthesis
Proceedings of the 38th annual Design Automation Conference
Symbolic algebra and timing driven data-flow synthesis
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Gröbner Bases: A Short Introduction for Systems Theorists
Computer Aided Systems Theory - EUROCAST 2001-Revised Papers
On solving systems of algebraic equations via ideal bases and elimination theory
SYMSAC '81 Proceedings of the fourth ACM symposium on Symbolic and algebraic computation
Some comments on the modular approach to Gröbner-bases
ACM SIGSAM Bulletin
Finding linear building-blocks for RTL synthesis of polynomial datapaths with fixed-size bit-vectors
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
Arithmetic Circuit Verification Based on Symbolic Computer Algebra
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Integration, the VLSI Journal
Ideals, bifiltered modules and bivariate Hilbert polynomials
Journal of Symbolic Computation
Algebraic techniques to enhance common sub-expression elimination for polynomial system synthesis
Proceedings of the Conference on Design, Automation and Test in Europe
On Buchberger's method of solving systems of algebraic equations
ACM Communications in Computer Algebra
Differential Gröbner bases in one variable and in the partial case
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.00 |
We give a uniqueness theorem for Gröbner-bases of polynomial ideals and show that it is effectively decidable whether a given basis is a (minimal normed) Gröbner-basis. Incidentally, we show how our methods may be applied to decide α ≤ β for given polynomial ideals α and β.