Puiseux series solutions of ordinary polynomial differential equations: complexity study.
Ayad, Ali (2010)
Acta Universitatis Apulensis. Mathematics - Informatics
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Ayad, Ali (2010)
Acta Universitatis Apulensis. Mathematics - Informatics
Similarity:
Panagiotis Tzekis, Nicholas Karampetakis, Haralambos Terzidis (2007)
International Journal of Applied Mathematics and Computer Science
Similarity:
The main contribution of this work is to provide an algorithm for the computation of the GCD of 2-D polynomials, based on DFT techniques. The whole theory is implemented via illustrative examples.
Andrzej Łęcki, Zbigniew Szafraniec (1996)
Banach Center Publications
Similarity:
Yuri Bilu, Robert Tichy (2000)
Acta Arithmetica
Similarity:
Frédéric Chyzak (2011)
Les cours du CIRM
Similarity:
Bill Allombert, Karim Belabas (2008)
Journal de Théorie des Nombres de Bordeaux
Similarity:
We describe a simple procedure to find Aurifeuillian factors of values of cyclotomic polynomials for integers and . Assuming a suitable Riemann Hypothesis, the algorithm runs in deterministic time , using space, where .
Brunotte, Horst (2009)
Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]
Similarity: