Challenges of Symbolic Computation: My Favorite Open Problems

@article{Kaltofen2000ChallengesOS,
  title={Challenges of Symbolic Computation: My Favorite Open Problems},
  author={Erich Kaltofen},
  journal={J. Symb. Comput.},
  year={2000},
  volume={29},
  pages={891-919}
}
The success of the symbolic mathematical computation discipline is striking. The theoretical advances have been continuous and significant: Gröbner bases, the Risch integration algorithm, integer lattice basis reduction, hypergeometric summation algorithms, etc. From the beginning in the early 60s, it has been the tradition of our discipline to create software that makes our ideas readily available to scientists, engineers, and educators: SAC-1, Reduce, Macsyma, etc. The commercial viability of… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

FILTER CITATIONS BY YEAR

1999
2019

CITATION STATISTICS

  • 5 Highly Influenced Citations

  • Averaged 2 Citations per year over the last 3 years

References

Publications referenced by this paper.
SHOWING 1-10 OF 111 REFERENCES

Efficient algorithms for computing the nearest polynomial with a real root and related problems

  • M. A. Hitz, E. Kaltofen, N LakshmanY.
  • 1999
Highly Influential
4 Excerpts

Seminumerical Algorithms, volume 2 of The Art of Computer Programming

  • D. E. Knuth
  • 1997
Highly Influential
3 Excerpts

Achiezer. Theory of Approximation

  • N I.
  • Translated by C. J. Hyman
  • 1956
Highly Influential
6 Excerpts

Similar Papers

Loading similar papers…