Sciweavers

Share
ISSAC
2011
Springer
243views Mathematics» more  ISSAC 2011»
10 years 2 months ago
Practical polynomial factoring in polynomial time
There are several algorithms for factoring in Z[x] which have a proven polynomial complexity bound such as Sch¨onhage of 1984, Belabas/Kl¨uners/van Hoeij/Steel of 2004, and vanH...
William Hart, Mark van Hoeij, Andrew Novocin
ISSAC
2011
Springer
225views Mathematics» more  ISSAC 2011»
10 years 2 months ago
On the structure of compatible rational functions
A finite number of rational functions are compatible if they satisfy the compatibility conditions of a first-order linear functional system involving differential, shift and q-...
Shaoshi Chen, Ruyong Feng, Guofeng Fu, Ziming Li
Mathematics
Top of PageReset Settings
books