Challenges of Symbolic Computation: My Favorite Open Problems

Journal of Symbolic Computation

Volumn 29, Issue 6, 2000, Pages 891-919

  Kaltofen, Erich ^a  

^a NORTH CAROLINA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0003043247     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.2000.0370     Document Type: Article

References (120)

1. S. K. Abdali, G. W. Cherry, N. Soiffer, Proceedings of the 1986 Symposium on Symbolic Algebraic Computation, Symsac '86, Char, B. W. 1986, ACM, New York, 24, 30.
2. Achiezer N. I. Theory of Approximation. 1956;Frederick Ungar Publ. Co, New York.
3. M. Ajtai, C. Dwork, Proceedings of the 29th Annual ACM Symposium on the Theory of Computing, 1997, ACM Press, New York, 284, 293.
4. Antoniou A. Digital Filters: Analysis and Design. 1979;McGraw-Hill Book Co, New York.
5. L. Babai, 1979, Univ. de Montréal, Dép. de mathématiques et de statistique.
6. Babai L. On Lovász lattice reduction and the nearest lattice point problem. Combinatorica. 6:1986;1-13.
7. O. Bachmann, H. Schönemann, S. Gray, pp. 165, 175.
8. Bailey D., Borwein P., Plouffe S. On the rapid computation of various polylogarithmic constants. Math. Comput. 66:1997;903-913.
9. Becker T., Weispfenning V. Gröbner Bases. A Computational Approach to Commutative Algebra. 1993;Springer Verlag, New York.
10. Berlekamp E. R. Factoring polynomials over large finite fields. Math. Comput. 24:1970;713-735.
11. L. Bernardin, B. Char, E. Kaltofen, pp. 237, 244.
12. Bernstein D. J. Composing power series over a finite ring in essentially linear time. J. Symb. Comput. 26:1998;339-341.
13. Boppana R. B., Hirschfeld R. Pseudorandom generators and complexity classes. Micali S. Randomness and Computation. 1989;1-26 JAI Press Inc, Greenwhich, Connecticut.
14. J. M. Borwein, P. Lisoněk.
15. Brent R. P., Gustavson F. G., Yun D. Y. Y. Fast solution of Toeplitz systems of equations and computation of Padé approximants. J. Algorithms. 1:1980;259-295.
16. Bronstein M. Symbolic Integration I (Transcendental Functions). 1997;Springer Verlag.
17. Brown W. S. On Euclid's algorithm and the computation of polynomial greatest common divisors. J. ACM. 18:1971;478-504.
18. Brown W. S., Traub J. F. On Euclid's algorithm and the theory of subresultants. J. ACM. 18:1971;505-514.
19. B. Buchberger, 1965.
20. Buchberger B. Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems. Aequationes Math. 4:1970;374-383.
21. Buchberger B. Gröbner bases: An algorithmic method in polynomial ideal theory. Bose N. K. Recent Trends in Multidimensional Systems Theory. 1985;184-232 D. Reidel Publ. Comp, Dordrecht (Holland).
22. Bürgisser P., Clausen M., Shokrollahi M. A. Algebraic Complexity Theory. 1997;Springer Verlag, Heidelberg, Germany.
23. Canny J. Generalized characteristic polynomials. J. Symb. Comput. 9:1990;241-250.
24. J. Canny, E. Kaltofen, L. Yagati, Proceedings of the ACM-SIGSAM 1989 International Symposium on Symbolic Algebraic Computation, ISSAC '89, 1989, ACM, 121, 128.
25. Carathéodory C. Theory of Functions of a Complex Variable. 1964;Chelsea, New York.
26. Caviness B. F., Johnson J. R., eds. Quantifier Elimination and Cylindrical Algebraic Decomposition. 1998;Springer Verlag, Berlin/Heidelberg.
27. Collins G. E. A method for overlapping and erasure of lists. Commun. ACM. 3:1960;655-657.
28. R. M. Corless, P. M. Gianni, B. M. Trager, S. M. Watt, pp. 96, 103.
29. Corless R. M., Jeffrey D. J. The unwinding number. SIGSAM Bull. 30:1996;28-35.
30. Cox D., Little J., O'Shea D. Ideals, Varieties and Algorithms. 1996;Springer, New York.
31. S. Dalmas, M. Gaëtano, S. Watt.
32. A. Díaz, E. Kaltofen, pp. 30, 37.
33. A. Dingle, R. Fateman, ISSAC '94, Proceedings of the International Symposium on Symbolic Algebraic Computation, 1994, 250, 257.
34. S, ed. Dooley, ISSAC '99, Proceedings of the 1999 International Symposium on Symbolic Algebraic Computing, 1999, ACM Press, New York.
35. W. Eberly, E. Kaltofen, pp. 176, 183.
36. Eckart C., Young G. The approximation of one matrix by another of lower rank. Psychometrika. 1:1936;211-218.
37. Emiris I. Z., Galligo A., Lombardi H. Certified approximate univariate GCDs. J. Pure Appl. Algebra. 117 & 118:1997;229-251.
38. I. Z. Emiris, V. Y. Pan, pp. 189, 196.
39. M. J. Encarnación, pp. 265, 270.
40. J.-C. Faugère.
41. H. R. P. Ferguson, D. H. Bailey, 1996, NASA Ames Research Center.
42. Fiduccia C. M. On obtaining upper bounds on the complexity of matrix multiplication. Miller R. E., Thatcher J. W. Complexity of Computer Computations. 1972;31-40 Plenum Press, New York.
43. C. M. Fiduccia, 1973.
44. A. Galligo, S. Watt, pp. 217, 224.
45. Gantmacher F. R. The Theory of Matrices. 1960;Chelsea Publ. Co, New York.
46. von zur Gathen J., Gerhard J. Modern Computer Algebra. 1999;Cambridge University Press, Cambridge.
47. von zur Gathen J., Shoup V. Computing Frobenius maps and factoring polynomials. Comput. Complexity. 2:1992;187-224.
48. M. Giesbrecht, pp. 1, 10.
49. M. Giesbrecht, A. Lobo, B. D. Saunders, pp. 113, 119.
50. O, ed. Gloor, ISSAC 98, Proceedings of the International Symposium on Symbolic Algebraic Computation, 1998, ACM Press, New York.
51. O. Goldreich, S. Goldwasser, S. Halevi, pp. 103, 111.
52. O. Goldreich, S. Goldwasser, S. Halevi, pp. 112, 131.
53. Golub G. H., Van Loan C. F. Matrix Computations. 1996;Johns Hopkins University Press, Baltimore.
54. Griewank A. Achieving logarithmic growth of temporal and spatial complexity in reverse automatic differentiation. Optimization Methods & Software. 1:1992;35-54.
55. D. Y. Grigoriev, Y. N. Lakshman, pp. 96, 103.
56. Håstad J., Just B., Lagarias J. C., Schnorr C. P. Polynomial time algorithms for finding integer relations among real numbers. SIAM J. Comput. 18:1989;859-881.
57. M. Hitz, E, eds, Kaltofen, Second International Symposium on Parallel Symbolic Computing PASCO '97, 1997, ACM Press, New York.
58. M. A. Hitz, E. Kaltofen, pp. 236, 243.
59. M. A. Hitz, E. Kaltofen, Y. N. Lakshman, pp. 205, 212.
60. P. Husbands, C. L. Jr. Isbell, A. Edelman.
61. P. Iglio, G. Attardi, pp. 62, 60.
62. P. Ion, R. Miner.
63. D. J. Jeffrey, Proceedings of 1993 International Symposium on Symbolic Algebraic Computation, ISSAC '93, Bronstein, M. 1993, ACM Press, New York, 34, 41.
64. Jeffrey D. J. The importance of being continuous. Math. Mag. 67:1994;294-300.
65. Jeffrey D. J. Rectifying transformations for the integration of rational trigonometric functions. J. Symb. Comput. 24:1997;563-573.
66. Jeffrey D. J., Rich A. D. The evaluation of trigonometric integrals avoiding spurious discontinuities. ACM Trans. Math. Softw. 20:1994;124-135.
67. Jenks R. D., Sutor R. S. The Scientific Computing System. 1992;Springer Verlag, New York.
68. Kahan W. Numerical linear algebra. Can. Math. Bull. 9:1966;757-801.
69. Kaliski B. S. Jr., ed. Advances in Cryptology - CRYPTO '97. 1997;Springer, Berlin.
70. Kaltofen E. Polynomial factorization 1987-1991. Simon I. Proceedings of LATIN '92. 1992;294-313 Springer Verlag, Heidelberg, Germany.
71. Kaltofen E. Effective Noether irreducibility forms and applications. J. Comput. Syst. Sci. 50:1995;274-295.
72. Kaltofen E., Lakshman Y. Improved sparse multivariate polynomial interpolation algorithms. Gianni P. Symbolic Algebraic Computation on International Symposium on ISSAC '88 Proceedings. 1988;467-474 Springer Verlag, Heidelberg, Germany.
73. E. Kaltofen, M. Monagan, pp. 59, 66.
74. E. Kaltofen, V. Shoup, pp. 184, 188.
75. Kaltofen E., Shoup V. Subquadratic-time factoring of polynomials over finite fields. Math. Comput. 67:1998;1179-1197.
76. Kaltofen E., Trager B. Computing with polynomials given by black boxes for their evaluations: Greatest common divisors, factorization, separation of numerators and denominators. J. Symb. Comput. 9:1990;301-320.
77. Kaminski M., Kirkpatrick D. G., Bshouty N. H. Addition requirements for matrix and transposed matrix products. J. Algorithms. 9:1988;354-364.
78. N. Karmarkar, Y. N. Lakshman, pp. 35, 42.
79. Knuth D. E. Seminumerical Algorithms. 1997;Addison Wesley, Reading, MA, USA.
80. W, ed. Küchlin, ISSAC 97, Proceedings of the 1997 International Symposium on Symbolic Algebraic Computation, 1997, ACM Press, New York.
81. Y. N, ed. Lakshman, ISSAC 95 Proceedings of the 1996 International Symposium on Symbolic Algebraic Computation, 1996, ACM Press, New York.
82. Y. N. Lakshman, B. Char, J. Johnson, pp. 46, 53.
83. R. Lambert, 1996.
84. Lawden D. F. Elliptic Functions and Applications, volume 80 of AMS. 1989;Springer Verlag.
85. Lazard D. Résolution des systèmes d'équation algébriques. Theor. Comput. Sci. 15:1981;77-110.
86. H. Le, C. Howlett, pp. 299, 306.
87. Lenstra A. K. Factoring multivariate polynomials over algebraic number fields. SIAM J. Comput. 16:1987;591-598.
88. Lenstra A. K., Lenstra H. W. Jr., Lovász L. Factoring polynomials with rational coefficients. Math. Ann. 261:1982;515-534.
89. A. H. M, ed. Levelt, Proceedings of the 1995 International Symposium on Symbolic Algebraic Computation, ISSAC '95, 1995, ACM Press, New York.
90. Loos R. Computing in algebraic extensions. Buchberger B., Collins G., Loos R. Computer Algebra. 1982;173-187 Springer Verlag, Vienna.
91. Loos R. G. K. Toward a formal implementation of computer algebra. SIGSAM Bull. 8:1974;9-16.
92. Macaulay F. S. Algebraic Theory of Modular Systems. 1916;Cambridge University, England.
93. Massey J. L. Shift-register synthesis and BCH decoding. IEEE Trans. Inf. Theory IT-15. 1969;122-127.
94. Minnichelli R. J., Anagnost J. J., Desoer C. A. An elementary proof of Kharitonov's stability theorem with extensions. IEEE Trans. Autom. Control. 34:1989;995-998.
95. M. B. Monagan, Proceedings of DISCO '93, Miola, A. 1993, Springer Verlag, Heidelberg, Germany, 81, 94.
96. T. Mulders, A. Storjohann, pp. 181, 188.
97. Musser D. R. Multivariate polynomial factorization. J. ACM. 22:1975;291-308.
98. Musser D. R., Saini A. STL Tutorial and Reference Guide C + + Programming with the Standard Template Library. 1996;Addison-Wesley Publ. Comp, Reading, MA.
99. A. Norman, J. Fitch, Proceedings of DISCO '96, Calmet, J.Limongelli, C. 1996, Springer Verlag, Heidelberg, Germany, 271, 276.
100. A. Odlyzko, Austria.
101. M. Petkovšek, H. S. Wilf, D. Zeilberger, A, B.
102. Poljak S., Rohn J. Checking robust nonsingularity is NP-hard. Math. Control Signals Syst. 6:1993;1-9.
103. Risch R. H. The problem of integration in finite terms. Trans. Am. Math. Soc. 139:1969;167-189.
104. Schönhage A. Quasi-GCD computations. J. Complexity. 1:1985;118-137.
105. Shirayanagi K. Floating point Gröbner bases. Math. Comput. Simul. 42:1996;509-528.
106. Shoup V. Fast construction of irreducible polynomials over finite fields. J. Symb. Comput. 17:1994;371-391.
107. Shoup V. A new polynomial factorization algorithm and its implementation. J. Symb. Comput. 20:1995;363-397.
108. V. Shoup.
109. V. Shoup, pp. 53, 58.
110. H. J. Stetter, pp. 117, 124.
111. Stoutemyer D. R. Crimes and misdemeanors in the computer algebra trade. Notices AMS. 38:1991;778-785.
112. Teitelbaum J. Euclid's algorithm and the Lanczos method over finite fields. Math. Comput. 67:1998;1665-1678.
113. B. M. Trager, Proceedings of the 1976 ACM Symposium on Symbolic Algebraic Computation, 1976, ACM, New York, 219, 228.
114. G. Villard, pp. 32, 39.
115. G. Villard.
116. P. S. Wang, pp. 291, 298.
117. S. M. Watt, P. A. Broadbery, S. S. Dooley, P. Iglio, S. C. Morrison, J. M. Steinbach, R. S. Sutor, ISSAC '94, Proceedings of the International Symposium on Symbolic Algebraic Computation, 1994, ACM Press, New York, 25, 31.
118. Weinberger P. J., Rothschild L. P. Factoring polynomials over algebraic number fields. ACM Trans. Math. Softw. 2:1976;335-350.
119. Wiedemann D. Solving sparse linear equations over finite fields. IEEE Trans. Inf. Theory IT-32. 1986;54-62.
120. Zhi L., Wu W. Nearest singular polynomial. J. Symb. Comput. 26:1998;667-675.