3454 search results - page 125 / 691 » Modern computer algebra |
204
click to vote
AB
2008
Springer
16 years 22 days ago
2008
Springer
We explore the computational power of biochemistry with respect to basic chemistry, identifying complexation as the basic mechanism that distinguishes the former from the latter. W...
161
click to vote
DIS
2007
Springer
16 years 16 days ago
2007
Springer
Abstract. We discuss what constitutes knowledge in pure mathematics and how new advances are made and communicated. We describe the impact of computer algebra systems, automated th...
145
click to vote
ISSAC
2007
Springer
16 years 16 days ago
2007
Springer
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
160
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract – This study presents Albert Burroni’s polygraphs as an algebraic and graphical description of first-order functional programs, where functions can have many outputs....
148
click to vote
ANTS
2004
Springer
15 years 11 months ago
2004
Springer
Given an algebraic number field K, such that [K : Q] is constant, we show that the problem of computing the units group O∗ K is in the complexity class SPP. As a consequence, w...