A theoretical basis for the reduction of polynomials to canonical forms 论文
1976ACM SIGSAM Bulletin引用 284
Computability, Logic, AI AlgorithmsCommutative Algebra and Its Applications
摘要
We define a certain type of bases of polynomial ideals whose usefulness stems from the fact that a number of computability problems in the theory of polynomial ideals (e.g. the problem of constructing canonical forms for polynomials) is reducible to the construction of bases of this type. We prove a characterization theorem for these bases which immediately leads to an effective method for their construction.