A SUPEREXPONENTIAL LOWER BOUND FOR GROBNER BASES AND CHURCH-ROSSER COMMUTATIVE THUE SYSTEMS

被引：22
作者：
HUYNH, DT
机构：
来源：
INFORMATION AND CONTROL | 1986年 / 68卷 / 1-3期
关键词：
D O I：
10.1016/S0019-9958(86)80035-3
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：196 / 206
页数：11
相关论文
共 9 条
[1]   NEW DECISION ALGORITHMS FOR FINITELY PRESENTED COMMUTATIVE SEMIGROUPS [J].
BALLANTYNE, AM ;
LANKFORD, DS .
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1981, 7 (02) :159-165
[2]  
BOOK RV, 1983, COMBINATORICS WORDS, P1
[3]  
Buchberger B., 1970, AEQUATIONES MATH, V4, P374, DOI 10.1007/BF01844169
[4]  
BUCHBERGER B, RECENT TRENDS MULTID
[5]  
Buchberger B., 1976, ACM SIGSAM B, V10, P19, DOI DOI 10.1145/1088216.1088219
[6]  
CARDOZA E, 1975, MIT67 TECH MEM
[7]   RATIONAL SETS IN COMMUTATIVE MONOIDS [J].
EILENBERG, S ;
SCHUTZENBERGER, MP .
JOURNAL OF ALGEBRA, 1969, 13 (02) :173-+
[8]   THE COMPLEXITY OF THE WORD-PROBLEMS FOR COMMUTATIVE SEMIGROUPS AND POLYNOMIAL IDEALS [J].
MAYR, EW ;
MEYER, AR .
ADVANCES IN MATHEMATICS, 1982, 46 (03) :305-329
[9]  
[No title captured]
1