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

[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]. JOURNAL OF THE ACM, 1971, 18 (02) : 290 - &

[6] A MACHINE-INDEPENDENT THEORY OF COMPLEXITY OF RECURSIVE FUNCTIONS [J]. 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

[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]. JOURNAL OF THE ACM, 1971, 18 (02) : 290 - &

[6] A MACHINE-INDEPENDENT THEORY OF COMPLEXITY OF RECURSIVE FUNCTIONS [J]. 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