ALGEBRAIC COMPLEXITY THEORY

[1] O(N2.7799) COMPLEXITY FOR N BY N APPROXIMATE MATRIX MULTIPLICATION [J]. INFORMATION PROCESSING LETTERS, 1979, 8 (05) : 234 - 235

[2] BINI D, 1979, B798 I EL INF NOT IN

[3] Brent R. P., 1980, J ALGORITHMS, V1, P259

[4] FAST MULTIPLE-PRECISION EVALUATION OF ELEMENTARY FUNCTIONS [J]. JOURNAL OF THE ACM, 1976, 23 (02) : 242 - 251

[5] COMPLEXITY OF COMPOSITION AND GENERALIZED COMPOSITION OF POWER-SERIES [J]. SIAM JOURNAL ON COMPUTING, 1980, 9 (01) : 54 - 66

[6] FAST ALGORITHMS FOR MANIPULATING FORMAL POWER-SERIES [J]. JOURNAL OF THE ACM, 1978, 25 (04) : 581 - 595

[7] BUNCH JR, 1974, MATH COMPUT, V28, P231, DOI 10.1090/S0025-5718-1974-0331751-8

[8] AN ALGORITHM FOR MACHINE CALCULATION OF COMPLEX FOURIER SERIES [J]. MATHEMATICS OF COMPUTATION, 1965, 19 (90) : 297 - &

[9] Csanky L., 1976, SIAM Journal on Computing, V5, P618, DOI 10.1137/0205040

[10] CSANKY L, 1975, IEEE S F COMPUT SCI, V16, P11

[1] O(N2.7799) COMPLEXITY FOR N BY N APPROXIMATE MATRIX MULTIPLICATION [J]. INFORMATION PROCESSING LETTERS, 1979, 8 (05) : 234 - 235

[2] BINI D, 1979, B798 I EL INF NOT IN

[3] Brent R. P., 1980, J ALGORITHMS, V1, P259

[4] FAST MULTIPLE-PRECISION EVALUATION OF ELEMENTARY FUNCTIONS [J]. JOURNAL OF THE ACM, 1976, 23 (02) : 242 - 251

[5] COMPLEXITY OF COMPOSITION AND GENERALIZED COMPOSITION OF POWER-SERIES [J]. SIAM JOURNAL ON COMPUTING, 1980, 9 (01) : 54 - 66

[6] FAST ALGORITHMS FOR MANIPULATING FORMAL POWER-SERIES [J]. JOURNAL OF THE ACM, 1978, 25 (04) : 581 - 595

[7] BUNCH JR, 1974, MATH COMPUT, V28, P231, DOI 10.1090/S0025-5718-1974-0331751-8

[8] AN ALGORITHM FOR MACHINE CALCULATION OF COMPLEX FOURIER SERIES [J]. MATHEMATICS OF COMPUTATION, 1965, 19 (90) : 297 - &

[9] Csanky L., 1976, SIAM Journal on Computing, V5, P618, DOI 10.1137/0205040

[10] CSANKY L, 1975, IEEE S F COMPUT SCI, V16, P11