THE COMPLEXITY OF THE WORD-PROBLEMS FOR COMMUTATIVE SEMIGROUPS AND POLYNOMIAL IDEALS

被引:311
作者
MAYR, EW
MEYER, AR
机构
关键词
D O I
10.1016/0001-8708(82)90048-2
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
引用
收藏
页码:305 / 329
页数:25
相关论文
共 43 条
[1]  
Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st
[2]  
[Anonymous], 1958, UCHEN ZAP IVANOVSKOG, V18, P49
[3]  
[Anonymous], 1971, STOC 71, DOI DOI 10.1145/800157.805047
[4]  
Biryukov AP, 1967, SIBERIAN MATH J, V8, P384
[5]   EFFECTIVE PROCEDURES FOR SPEEDING UP ALGORITHMS [J].
BLUM, M .
JOURNAL OF THE ACM, 1971, 18 (02) :290-&
[6]   A MACHINE-INDEPENDENT THEORY OF COMPLEXITY OF RECURSIVE FUNCTIONS [J].
BLUM, M .
JOURNAL OF THE ACM, 1967, 14 (02) :322-&
[7]  
CARDOZA EW, 1975, COMPUTATIONAL COMPLE
[8]  
EMILICEV VA, 1963, SBIRSK MAT Z, V4, P788
[9]  
FERRANTE J, 1979, LECTURE NOTES MATH, V718
[10]  
Fischer P. C., 1968, Mathematical Systems Theory, V2, DOI 10.1007/BF01694011