Hierarchical representations with signatures for large expression management

Authors:
Wenqin Zhou;J. Carette;D. J. Jeffrey;M. B. Monagan
Affiliations:
University of Western Ontario, London, ON, Canada;McMaster University, Hamilton, ON, Canada;University of Western Ontario, London, ON, Canada;Simon Fraser University, Burnaby, B.C., Canada
Venue:
AISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Symbolic Computation
Year:
2006

Citing 23
Cited 3

Computing with polynomials given by straight-line programs I: greatest common divisors

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
New results for random determination of equivalence of expressions

SYMSAC '86 Proceedings of the fifth ACM symposium on Symbolic and algebraic computation
Greatest common divisors of polynomials given by straight-line programs

Journal of the ACM (JACM)
Signatures + abstract types + computer algebra - intermediate expression swell

Signatures + abstract types + computer algebra - intermediate expression swell
On computing determinants of matrices without divisions

ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
Signature functions for algebraic numbers

ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Dagwood: a system for manipulating polynomials given by straight-line programs

ACM Transactions on Mathematical Software (TOMS)
Two perturbation calculations in fluid mechanics using large-expression management

Journal of Symbolic Computation
A toolbox for program manipulation and efficient code generation with an application to a problem in computer vision

ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Modern computer algebra

Modern computer algebra
Fast Probabilistic Algorithms for Verification of Polynomial Identities

Journal of the ACM (JACM)
Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs

Journal of the ACM (JACM)
On the Simplification and Equivalence Problems for Straight-Line Programs

Journal of the ACM (JACM)
The projective noether maple package: computing the dimension of a projective variety

Journal of Symbolic Computation
Gauss: A Parameterized Domain of Computation System with Support for Signature Functions

DISCO '93 Proceedings of the International Symposium on Design and Implementation of Symbolic Computation Systems
Probabilistic algorithms for sparse polynomials

EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
Testing polynomials which are easy to compute (Extended Abstract)

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Determining the equivalence of algebraic expressions by hash coding

SYMSAC '71 Proceedings of the second ACM symposium on Symbolic and algebraic manipulation
Efficient Gaussian elimination method for symbolic determinants and linear systems (Extended Abstract)

SYMSAC '81 Proceedings of the fourth ACM symposium on Symbolic and algebraic computation
Determining equivalence of expressions in random polynomial time

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Understanding expression simplification

ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
A computational introduction to number theory and algebra

A computational introduction to number theory and algebra
Multi-stage programming with functors and monads: eliminating abstraction overhead from generic code

GPCE'05 Proceedings of the 4th international conference on Generative Programming and Component Engineering

Computing Properties of Numerical Imperative Programs by Symbolic Computation

Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Multi-stage programming with functors and monads: Eliminating abstraction overhead from generic code

Science of Computer Programming
Computing Properties of Numerical Imperative Programs by Symbolic Computation

Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a method for managing large expressions in symbolic computations which combines a hierarchical representation with signature calculations. As a case study, the problem of factoring matrices with non-polynomial entries is studied. Gaussian Elimination is used. Results on the complexity of the approach together with benchmark calculations are given.