5510 search results - page 326 / 1102 » Mathematics |
155
click to vote
ISSAC
2009
Springer
16 years 1 months ago
2009
Springer
In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects, we call m-schemes, that are generalizations o...
153
click to vote
ISSAC
2009
Springer
16 years 1 months ago
2009
Springer
Constructive methods for matrices of multihomogeneous resultants for unmixed systems have been studied in [7, 14, 16]. We generalize these constructions to mixed systems, whose Ne...
169
click to vote
ISSAC
2009
Springer
16 years 1 months ago
2009
Springer
We present an iterative algorithm for calculating approximate greatest common divisor (GCD) of univariate polynomials with the real coefficients. For a given pair of polynomials a...
201
click to vote
MKM
2009
Springer
16 years 1 months ago
2009
Springer
Methods for deciding quantifier-free non-linear arithmetical conjectures over R are crucial in the formal verification of many realworld systems and in formalised mathematics. Wh...
169
click to vote
DOCENG
2009
ACM
16 years 1 months ago
2009
ACM
We study the analysis problem of XPath expressions with counting constraints. Such expressions are commonly used in document transformations or programs in which they select porti...