On the computational complexity of polynomials and bilinear mappings. A survey

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 356 LNCS, Issue , 1989, Pages 269-300

  Heintz, Joos ^a  

^a INSTITUTO ARGENTINO DE MATEMÁTICA   (Argentina)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001365155     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-51082-6_85     Document Type: Conference Paper

References (58)

1. Alder, A. & Strassen, V. On the algorithmic complexity of associative algebras (1981) Theoret. Comput. Sci 15 (1981) 201-211.
2. Baur, W. oral communication (1980).
3. Baur, W. & Strassen, V. The complexity of partial derivatives (1982) Theoret. Comput. Sci. 22 (1982) 317-330.
4. Belaga, E.G. Evaluation of polynomials of one variable with preliminary processing of the coefficients (1961) Problemy Kibernetiki 5 (1961) 7-15.
5. 2.7799) complexity for matrix multiplication (1979) Inform. Proc. Letters 8 (1979) 234-235.
6. Büchi, W. & Clausen, M. On a Class of Primary Algebras of Minimal Rank (1985)
7. Linear Algebra and its Appl. 691(1985) 249-268.
8. Coppersmith, D. & Winograd, S. On the asymptotic complexcity of matrix multiplication (1982) SIAM J. Comput. 11 (1982) 472-492.
9. Coppersmith, D. & Winograd, S. Matrix multiplication via Behrend “s Theorem (1986). Preprint, IBM Thomas J. Watson Research Center Yorktown Heights (1986).
10. Feig, E. On systems of bilinear forms whose minimal divisor-free algorithms are all bilinear (1961) J. of Algorithms 2 (1981) 261-281.
11. Fellmann, A. Optimal algorithms for the multiplication in simply generated local algebras (1985) Interner Bericht 4/1985, FB Informatik, Universität Frankfurt/M.
12. Fellmann, A. Algorithmenvarietiiten der kommutativen Alge bren minimalen Ranges (1988) Ph.-D. thesis, Universitat Frankfurt/M.
13. Fiduccia, C. & Zalcstein, I. Algebras having linear multiplicative complexity (1977) J. of the ACM 24 (1977) 311-331.
14. von zur Gathen, J. & Strassen, V. Some polynomials that are hard to compute (1980) Theoret. Comput. Sci. 11-3 (1980) 331-336.
15. Giraldo, L.E. Ph.-D. thesis, Universidad Buenos Aires.
16. Grigor' ev, D.Yu. Notes of Scientific Seminars of LOMI 118 (1982) 25-82.
17. de Groote, H.F. On varieties of optimal algorithms for the computation of bilinear mappings. I. The isotropy group of a bilinear mapping (1978 (a)) Theoret. Comput, Sci. 7 (1976) 1-24.
18. de Groote, H.F. On varieties o jr optimal algorithms ]or the computation o] bilinear mappings, II. Optimal algorithms for 2 z 2- matri multiplication (1978 (b)) Theoret. Comput. Sci. 7 (1978) 127-148.
19. de Groote, H.F. Characterization of division algebras of minimal rank and the structure of their algorithms varieties (1983) SIAM J. of Comput. 12-1 (1983) 101-117.
20. de Groote, H.F. Lectures on the complexity of bilinear problems (1987) LN Comput. Sci. 245, Springer, Berlin Heidelberg (1987).
21. de Groote, H.F. & Heintz, J. Commutative algebras of minimal trade (1983) Linear Algebra and its Appl. 55 (1983) 37-68.
22. de Groote, H.F. & Heintz, J. A lower bound ]or the bilinear complexity of some semisimple Liealgebras (1985) in: Proceedings of the AAECC-3 Conference, Grenoble 1985. LN Comput. Sci. 229, Springer, Berlin Heidelberg (1987) 211-222.
23. Heintz, J. Definability and -fast quantifier elimination in algebraically closed fields (1983 (a)) Ph.-D. thesis, Universitfit Ztirich 1982. Theoret. Comput, Sci. 24 (1983) 239-277. Russian translation in: Kiberneticeskij Sbornik, Novaja Serija, Vyp. 22, Ed. 0,B. Lupanov, Mir Moscow (1985) 113- 158.
24. Heintz, J. A Polynomials with Symmetric Galois Group which are Easy to Compute (1986) Theoret. Comput. Sci. 47 (1986) 99-105.
25. Heintz, J. & Morgenstern, J. On associative algebras of minimal rank (1985) in: Proceedings of the AAECC-2 Conference, Toulouse 1984. LN Comput. Sci. 228, Springer, Berlin Heidelberg (1986) 1-24.
26. Heintz, J. & Schnorr, C.P. Testing Polynomials which are Easy to Compute (1982) Logic and Algorithmic. An international Symposium held in honour of Ernst Specker. Monographie No. 30 de L’Enseignement Math6matique, Geneve 1982, 237-254; also published in: 12th Annual Symposium ACM on Computing (1980) 262-280.
27. Heintz, J. & Sieveking M. Lower bounds for polynomials with algebraic coefficients (1980) Theoret. Comput. Sci. 11 (1980) 321-330.
28. Heintz, J. & Sieveking M. Absolute Primality of Polynomials is Decidable in Random Polynomial Time in the Number Of Variables (1981) 8th International Colloquium on Automata, Languages, and Programming ICALP 81. LN Comput. Sci. 115, Springer Verlag, Berlin, 16-28.
29. Keller, W. Asymptotisch schnelle Algorithmen der tinearen Algebra (1982) Master’s thesis, Universität Ziirich.
30. Lafon, J.C. & Winograd, S. A lower bound for the multiplicative complexity of the product of two matrices (1978) (unpublished) manuscript.
31. Lang, S. Diophantine Geometry (1962) Interscience Publ. Wiley, New York.
32. Lipton, R.J. & Stockmeyer, L.J. Evaluation of polynomials with superpreconditioning (1976) Proc. 8th Annual ACM Symp. on Theory of Computing (1976) 174-180.
33. Mirwald, R. Die algorithmische Strulctur der sl(2,k) (1985) Master’s thesis, Universitat Frankfurt/M. an English abstract in: Proceedings of the AAECC-3 Conference, Grenoble 1985. LN Comput. Sci. 229, Springer, Berlin Heidelberg (1986) 274-287.
34. Möhler, St. Komplexitatstheorie aufl6sbarer Lie Algebren (1987) Master’s thesis, Universitat Frankfurt/M.
35. Morgenstern, J. Preprint (1984), University of Nice.
36. Motzkin, T.S. Evaluation of polynomials and evaluation of rational functions (1955) Bull. AMS 61 (1955) 163.
37. Ostrowski, A.M. On two problems in abstract algebre connected with Homer’s rule (1954) Studies in Math. and Mech. presented to Richard von Mises, Academic Press, New York (1954) 40-44.
38. Pan, V.Ya. Methods of computing values of polynomials (1966) Russian Math. Surveys 21-1 (1966) 105-136.
39. Paterson, M.S. & Stockmeyer, L.J. On the number of nonscalar multiplications necessary to evaluate polynomials (1973) SIAM J. Comput. 2 (1973) 60-86.
40. Risler, J.J. Additive complexity and zeros of real polynomials (1985) SIAM J. Comput. 14 (1985) 178-183.
41. Schmidt, H.D. Generische Unteralgebren und untere Schranken für die Komplexität der einfachen klassischen Lie Algebren (1987) Master’s thesis, Universitat Frankfurt/M.
42. Schnorr, C.P. Improved lower bounds on the number of multiplications,divisions which are necessary to evaluate polynomials (1978) Theoret. Comput. Sci. 7 (1978) 251-261.
43. Schnorr, C.P. An extension of Strassen’s degree bound (1981) SIAM J. Comput. 10 (1981) 371-382.
44. Schönhage, A. An elementary profsor Strassen ’s degree bound (1976) Theoret. Comput. Sci. 3 (1976) 267-272.
45. Schönhage, A. Partial and total matrix multiplication (1981) SIAM J. Comput. 10 (1981) 434-455.
46. Stoss, H.J. Untere Schranken für die Komplezität rationaler Funkticnen (1984)
47. Preprint, Universität Konstanz.
48. Strassen, V. Gaussian elimination is not optimal (1969) Numer. Mathematik 13 (1969) 354-356.
49. Strassen, V. Evaluation of rational functions (1972) in: Complexity of Computer Computations, R. Miller and J. Thatcher (Eds.), Plenum Press (1972) 1- 10.
50. Strassen, V. Vermeidung yon Divisionen (1973 (a)) Crelles Journal ftir die reine und angew. Mathematik 264 (1973) 184-202.
51. Strassen, V. Berechnungskomplexität von elementarsymmetrischen Funictionen und yon Interpolationskoeffizienten (1973 (b)) Numer. Mathematik 20-3 (1973) 238- 251.
52. Strassen, V. Polynomials with rational coefficients which are hard to compute (1974) SIAM J. Comput. 3-2 (1974) 128-149.
53. Strassen, V. Algebaische Berechnungskomplezität (1984) in: Perspectives in Mathematics, Anniversary of Oberwolfach 1984, Birkhäiuser Verlag, Basel, 509-550.
54. Strassen, V. Relative bilinear complexity and matrix multiplication (1986) Preprint, University Zurich (1986).
55. van der Waerden, B.L. Die Selterdzeit der Gleichungen mit Affekt (1934) Math. Annalen 109 (1934) 13-16.
56. van der Waerden, B.L. Algebra (1960) 5. Auflage der Modernen Algebra, Springer Verlag, Berlin.
57. Winograd, S, On computing the discrete Fourier transform (1976) Proc. Nat. Aead, Sci. USA 73 (1976) 1005-1006.
58. Winograd, S. Some bilinear forms whose multiplicative complexity depends on the field of constants (1977) Math. Systems Theory 10 (1977) 169-180.