Titlebook: Computer Algebra in Scientific Computing; 15th International W Vladimir P. Gerdt,Wolfram Koepf,Evgenii V. Vorozht Conference proceedings 20

cleaver

https://doi.org/10.1007/978-3-319-02297-0complexity; holonomic functions; long integers; parallel algorithms; polynomial factorization; algorithm

悄悄移动

978-3-319-02296-3Springer International Publishing Switzerland 2013

朦胧

我不明白

https://doi.org/10.1007/978-1-349-13443-4n the first two terms of a Puiseux series expansion. The leading powers of the series are computed via the tropical prevariety. This polyhedral algorithm is well suited for exploitation of symmetry, when it arises in systems of polynomials. Initial form systems with pretropisms in the same group orb

压舱物

antipsychotic

violate

Background And Fundamental Methods,ation .. of ., such that . − .. probably has at most half the number of terms of ., then recurses on the difference . − ... Our approach builds on previous work by Garg and Schost (2009), and Giesbrecht and Roche (2011), and is asymptotically more efficient in terms of the total cost of the probes r

开玩笑

enormous

BLAZE