12 search results - page 2 / 3 » Complexity issues in bivariate polynomial factorization |
CORR
2010
Springer
13 years 1 months ago
2010
Springer
In this paper we show how we can compute in a deterministic way the decomposition of a multivariate rational function with a recombination strategy. The key point of our recombinat...
CORR
2007
Springer
13 years 6 months ago
2007
Springer
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
GC
2002
Springer
13 years 6 months ago
2002
Springer
It is shown that the Hilbert series of the face ring of a clique complex (equivalently, flag complex) of a graph G is, up to a factor, just a specialization of SG (x, y), the subg...
ISSAC
2009
Springer
14 years 27 days ago
2009
Springer
We address complexity issues for linear differential equations in characteristic p > 0: resolution and computation of the p-curvature. For these tasks, our main focus is on al...
ATAL
2007
Springer
14 years 16 days ago
2007
Springer
This paper analyzes bilateral multi-issue negotiation between selfinterested autonomous agents. The agents have time constraints in the form of both deadlines and discount factors...