COMPUTING SHORT GENERATOR SEQUENCES

被引：8

作者：

DRISCOLL, JR

FURST, ML

机构：

来源：

关键词：

D O I：

10.1016/0890-5401(87)90043-5

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：117 / 132

页数：16

共 11 条

[1]

DRISCOLL JR, 1983, 15TH P ACM S THEOR C, P152

[2]

EVAN S, 1981, J ALGEBRA, V2, P311

[3]

Furst M., 1980, 21st Annual Symposium on Foundations of Computer Science, P36, DOI 10.1109/SFCS.1980.34

[4]

HALL M, 1959, THEORY GROUPS

[5]

Jerrum M., 1982, 23rd Annual Symposium on Foundations of Computer Science, P126, DOI 10.1109/SFCS.1982.52

[6] THE COMPLEXITY OF FINDING MINIMUM-LENGTH GENERATOR SEQUENCES [J].

JERRUM, MR .

[7]

KERNHAUSER D, 1984, 25TH S F COMP SCI, P241

[8]

Knuth D. E., 1973, ART COMPUTER PROGRAM

[9]

MCKENZIE P, 1983, INFORM PROCESS LETT, V19, P253

[10]

Sims C.C., 1970, COMPUTATIONAL PROBLE, P169, DOI 10.1016/B978-0-08-015871-6.50008-4