Understanding expression simplification

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn , Issue , 2004, Pages 72-79

  Carette, Jacques ^a  

^a MCMASTER UNIVERSITY   (Canada)

Author keywords

Computer algebra; Kolmogorov Complexity; Model description length; Simplification of expressions

Indexed keywords

ALGORITHMS; COMPUTER AIDED ANALYSIS; INFORMATION THEORY; MATHEMATICAL MODELS;

COMPUTER ALGEBRA; KOLMOGOROV COMPLEXITY; MODEL DESCRIPTION LENGTH; SIMPLIFICATION OF EXPRESSIONS;

ALGEBRA;

EID: 27644518814     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1005285.1005298     Document Type: Conference Paper

References (27)

1. J. Beaumont, R. Bradford, and J. H. Davenport. Better simplification of elementary functions through power series. In Proceedings of the &003 international symposium on symbolic and algebraic computation, pages 30-36. ACM Press, 2003.
2. R. Boyer and J. Moore. A Computational Logic Handbook. Academic Press, 1988.
3. M. Bronstein. Simplification of real elementary functions. In Proceedings of ISSAC 1989, pages 207-211, 1989.
4. B. Buchberger and R. Loos. Algebraic simplification. In B. Buchberger, G. E. Collins, and R. Loos, editors, Computer Algebra - Symbolic and Algebraic Computation, pages 11-44. Springer-Verlag, New York, 1982.
5. J. Carette, W. Farmer, and J. Wajs. Trustable communication between mathematical systems. In T. Hardin and R. Rioboo, editors, Proceedings of Calculemus 2003, pages 58-68, Rome, 2003. Aracne.
6. B. Caviness. On canonical forms and simplification. J. ACM, 17(2):385-396, 1970.
7. E. Cheb-Terrab. personal communication.
8. F. Chyzak and B. Salvy. Non-commutative elimination in ore algebras proves multivariate identities. Journal of Symbolic Computation, 26(2):187-227, 1998.
9. R. Corless, G. Gonnet, D. Hare, D. Jeffrey, and D. Knuth. On the Lambert W function. Advances in Computational Mathematics, 5:329-359, 1996.
10. R. M. Corless, J. H. Davenport, David J. Jeffrey, G. Litt, and S. M. Watt. Reasoning about the elementary functions of complex analysis. In Proceedings AISC Madrid, volume 1930 of Lecture Notes in AI. Springer, 2000.
11. J. Davenport, Y. Siret, and E.Tournier. Computer Algebra: Systems and Algorithms for Algebraic Computation. Academic Press, 1988.
12. W. M. Farmer and M. v. Mohrenschildt. Transformers for symbolic computation and formal deduction. In S. Colton, U. Martin, and V. Sorge, editors, Proceedings of the Workshop on the Role of Automated Deduction in Mathematics, CADE-17, pages 36-45, 2000.
13. W. M. Farmer and M. v. Mohrenschildt. An overview of a formal framework for managing mathematics. Annals of Mathematics and Artificial Intelligence, 2003.
14. In the forthcoming special issue: B. Buchberger, G. Gonnet, and M. Hazewinkel, eds., Mathematical Knowledge Management.
15. K. Geddes, S. Czapor, and G. Labahn. Algorithms for Computer Algebra. Kluwer, Boston/Dordrecht/London, 1992.
16. J. Grabmeier, E. Kaltofen, and V. Weispfenning, editors. Computer Algebra Handbook: Foundations, Applications, Systems. Springer-Verlag, 2003.
17. P. Grünwald. The Minimum Description Length Principle and Reasoning under Uncertainty. PhD thesis, CWI, 1998.
18. S. Landau. Simplification of nested radicals. SIAM Journal on Computing, 14(1):184-195, 1985.
19. M. Li and P. Vitanyi. An Introduction to Kolmogorov Complexity and Its Applications. Springer-Verlag, Berlin, 1997.
20. J. Moses. Algebraic simplification: a guide for the perplexed. Communications of the ACM, 14(8):548-560, 1971.
21. J. Mulholland and M. Monagan. Algorithms for trigonometric polynomials. In Proceedings of the 2001 international symposium on Symbolic and algebraic computation, pages 245-252. ACM Press, 2001.
22. J. Rissanen. Modeling by shortest data description. Automation, 14:465-471, 1978.
23. D. A. Schmidt. Denotational Semantics: A Methodology for Language Development. W. C. Brown, Dubuque, Iowa, 1986.
24. J. von zur Gathen and J. Gerhard. Modern Computer Algebra, Cambridge University Press, 2003.
25. C. S. Wallace and D. Dowe. Minimum message length and kolmogorov complexity. Computer Journal (special issue on Kolmogorov complexity), 42(4):270-283, 1999.
26. D. Zeilberger. A holonomic systems approach to special function identities. J. Comput. Appl. Math., 32:321-368, 1990.
27. R. Zippel. Simplification of expressions involving radicals. J. of Symbolic Computation, 1(1):189-210, 1985.