Related articles |
---|
Advanced expression simplification ichudov@algebra.com (2005-07-11) |
Re: Advanced expression simplification marcov@stack.nl (Marco van de Voort) (2005-07-11) |
Re: Advanced expression simplification haberg@math.su.se (2005-07-12) |
Re: Advanced expression simplification eugene.ressler@frontiernet.net (Gene) (2005-07-17) |
Advanced expression simplification drikosv@otenet.gr (Evangelos Drikos) (2005-07-17) |
Re: Advanced expression simplification liekweg@ipd.info.uni-karlsruhe.de (F. Liekweg) (2005-07-17) |
From: | "Evangelos Drikos" <drikosv@otenet.gr> |
Newsgroups: | comp.compilers |
Date: | 17 Jul 2005 13:47:28 -0400 |
Organization: | Compilers Central |
References: | 05-07-04005-07-053 |
Keywords: | optimize |
Posted-Date: | 17 Jul 2005 13:47:28 EDT |
Hi Igor,
Since you are working on expressions simplification, probably for
efficiency purposes, you might have a look on Horner Algorithm or
Horner Scheme, for efficient evaluation of polynomials.
With that algorithm you can restate a polynomial in such a way that needs at
most half multiplications.
Actually, it is an easy to implement algorithm and a good starting point
would be the wikipedia.com
I hope this helps.
E. Drikos
Return to the
comp.compilers page.
Search the
comp.compilers archives again.