We present a set of algorithms for automated simplification of symbolic constants of the form ∑<sub>i</sub>α<sub>i</sub>x<sub>i</sub> with α<sub>i</sub> rational and x<sub>i</sub> complex. The included algorithms, called <sub>SimplifySum</sub><sup>2</sup> and implemented in <i>Mathematica</i>, remove redundant terms, attempt to make terms and the full expression real, and remove terms using repeated application of the multipair PSLQ integer relation detection algorithm. Also included are facilities for making substitutions according to user-specified identities. We illustrate this toolset by giving some real-world examples of its usage, including one, for instance, where the tool reduced a symbolic expression of approximately 100 000 charac...
ii The goal of this thesis is to develop generic algorithms for computing in polyno-mial quotient ri...
We consider the problem of synthesizing provably non-overflowing integer arithmetic expressions or B...
We present a method to simplify expressions in the context of a formal, axiomatically defined, the- ...
The goal of this thesis is to develop generic algorithms for computing in polynomial quotient rings ...
Problems with simplification in current computer algebra systems is discussed, including the insolva...
The aim of this bachelor's degree project is to analyze problems of computer simplifications of alge...
The aim of this research is to design and implement a program that will be able to manipulate multip...
We consider a class of simplification algorithms for algebraic and logical expressions which are of ...
A prototype for an extensible interactive graphical term manipulation system is presented that combi...
Abstract We present lightweight and generic symbolic methods to improve the precision of numerical s...
Let x = (x{sub 1}, x{sub 2} {hor_ellipsis}, x{sub n}) be a vector of real or complex numbers. x is s...
We report on a new implementation of a reduction strategy in Coq to simplify terms during interactiv...
Capítulo 7.-- El pdf es la versión post-print.Symbolic circuit analysis suffers from the exponential...
We present a data structure to represent and manipulate large sets of (equal) terms (or expressions)...
A novel algorithm is presented that generates approximate symbolic expressions for small-signal char...
ii The goal of this thesis is to develop generic algorithms for computing in polyno-mial quotient ri...
We consider the problem of synthesizing provably non-overflowing integer arithmetic expressions or B...
We present a method to simplify expressions in the context of a formal, axiomatically defined, the- ...
The goal of this thesis is to develop generic algorithms for computing in polynomial quotient rings ...
Problems with simplification in current computer algebra systems is discussed, including the insolva...
The aim of this bachelor's degree project is to analyze problems of computer simplifications of alge...
The aim of this research is to design and implement a program that will be able to manipulate multip...
We consider a class of simplification algorithms for algebraic and logical expressions which are of ...
A prototype for an extensible interactive graphical term manipulation system is presented that combi...
Abstract We present lightweight and generic symbolic methods to improve the precision of numerical s...
Let x = (x{sub 1}, x{sub 2} {hor_ellipsis}, x{sub n}) be a vector of real or complex numbers. x is s...
We report on a new implementation of a reduction strategy in Coq to simplify terms during interactiv...
Capítulo 7.-- El pdf es la versión post-print.Symbolic circuit analysis suffers from the exponential...
We present a data structure to represent and manipulate large sets of (equal) terms (or expressions)...
A novel algorithm is presented that generates approximate symbolic expressions for small-signal char...
ii The goal of this thesis is to develop generic algorithms for computing in polyno-mial quotient ri...
We consider the problem of synthesizing provably non-overflowing integer arithmetic expressions or B...
We present a method to simplify expressions in the context of a formal, axiomatically defined, the- ...