Anemia
发表于 2025-3-25 06:41:28
http://reply.papertrans.cn/24/2335/233420/233420_21.png
minaret
发表于 2025-3-25 08:06:42
Murat Yilmaz,Paul Clarke,Bruno Wöranequations with polynomial coefficients) may be computed with error bounded by 2. in time . and space O (.). The standard fast algorithm for this task, due to Chudnovsky and Chudnovsky, achieves the same time complexity bound but requires . bits of memory.
可卡
发表于 2025-3-25 15:33:57
http://reply.papertrans.cn/24/2335/233420/233420_23.png
Arb853
发表于 2025-3-25 18:43:15
A New Algorithm for Long Integer Cube Computation with Some Insight into Higher Powers, new basic tool to improve long integer exponentiation: different techniques combining binary and ternary exponent expansion are shown. Effective implementations by using the GMP library are tested, and performance comparisons are presented.
Indurate
发表于 2025-3-25 23:36:39
http://reply.papertrans.cn/24/2335/233420/233420_25.png
geriatrician
发表于 2025-3-26 02:43:52
A Note on the Space Complexity of Fast D-Finite Function Evaluation,equations with polynomial coefficients) may be computed with error bounded by 2. in time . and space O (.). The standard fast algorithm for this task, due to Chudnovsky and Chudnovsky, achieves the same time complexity bound but requires . bits of memory.
Insulin
发表于 2025-3-26 06:17:15
http://reply.papertrans.cn/24/2335/233420/233420_27.png
饶舌的人
发表于 2025-3-26 08:38:24
On Polynomial Solutions of Linear Partial Differential and (,-)Difference Equations,olutions can be described algorithmically. We present examples which demonstrate that, in contrast with the differential and difference cases where the dimension of this space is either infinite or zero, in the .-difference case it can also be finite and non-zero.
Antecedent
发表于 2025-3-26 16:28:22
Computer Algebra in Scientific Computing978-3-642-32973-9Series ISSN 0302-9743 Series E-ISSN 1611-3349
消耗
发表于 2025-3-26 19:30:19
Michel Picard,Alain Renault,Béatrix Barafort polynomial equations. We first consider the case of two colors for which the problem is known to be hard and we then extend the approach to the general case. We also present a formulation of the rainbow connectivity problem as an ideal membership problem.