4 search results - page 1 / 1 » A poly-algorithmic approach to simplifying elementary functi... |
ISSAC
2004
Springer
13 years 10 months ago
2004
Springer
Simplification has been long recognised to be a fundamental problem within computer algebra[17]. However, even for the class of elementary functions, it has not been resolved in ...
AISC
2000
Springer
13 years 9 months ago
2000
Springer
There are many problems with the simplification of elementary functions, particularly over the complex plane. Systems tend to make “howlers” or not to simplify enough. In thi...
BMCBI
2007
13 years 4 months ago
2007
Background: The progress in the "-omic" sciences has allowed a deeper knowledge on many biological systems with industrial interest. This knowledge is still rarely used ...
JSAT
2006
13 years 4 months ago
2006
Abstract. We introduce new approaches intended to speed up determining the satisfiability of a given Boolean formula expressed as a conjunction of Boolean functions. A common prac...