A NOTE ON UPPER-BOUNDS FOR IDEAL-THEORETIC PROBLEMS

被引：11

作者：

LAZARD, D

机构：

[1] LITP, Institut Blaise Pascal, Paris, 75252, Boite 168, 4, place Jussieu

来源：

JOURNAL OF SYMBOLIC COMPUTATION | 1992年 / 13卷 / 03期

关键词：

D O I：

10.1016/S0747-7171(10)80001-X

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

An upper bound of d2x with x = n(log 3)/(log 4) is given for the generators of the module of the relations (syzygies) between a finite set of polynomials in n variables, of degree at most d, over a field. A similar bound with x = n(log 3)/(log 4) + O(log n) is deduced for a membership relation between a polynomial and an ideal given by generators. © 1992, Academic Press Limited. All rights reserved.

引用

页码：231 / 233

页数：3

共 7 条

[1] ON THE COMPLEXITY OF COMPUTING SYZYGIES [J].