TIME-SPACE TRADEOFFS FOR MATRIX MULTIPLICATION AND THE DISCRETE FOURIER-TRANSFORM ON ANY GENERAL SEQUENTIAL RANDOM-ACCESS COMPUTER

被引：14

作者：

YESHA, Y

机构：

来源：

关键词：

D O I：

10.1016/0022-0000(84)90029-1

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：183 / 197

页数：15

共 13 条

[1]

Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

BORODIN, A ;

COOK, S .

[3]

Borodin A., 1979, 20th Annual Symposium of Foundations of Computer Science, P319, DOI 10.1109/SFCS.1979.4

[4]

BORODIN A, 1980, 14380 U TOR DEP COMP

[5]

Cobham A., 1966, 7 ANN S SWITCHING AU, P78

[6]

Duris P., 1981, 22nd Annual Symposium on Foundations of Computer Science, P53, DOI 10.1109/SFCS.1981.9

[7]

HARDY G, 1965, INTRO THEORY NUMBERS, P343

[8]

Hopcroft J.E., 1979, INTRO AUTOMATA THEOR

[9]

Reisch S., 1982, 23rd Annual Symposium on Foundations of Computer Science, P45, DOI 10.1109/SFCS.1982.96

[10]

[No title captured]