1092 search results - page 43 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
DAGSTUHL
2008
15 years 1 months ago
2008
Abstract. We present algorithmic, complexity and implementation results concerning real root isolation of a polynomial of degree d, with integer coefficients of bit size , using S...
IJHPCA
2006
14 years 11 months ago
2006
In this paper, we consider the communications involved in the execution of a complex application, deployed on a heterogeneous platform. Such applications extensively use macro-com...
105
click to vote
ISAAC
2004
Springer
15 years 5 months ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
104
click to vote
PKC
2005
Springer
15 years 5 months ago
2005
Springer
In this paper, we present the cryptanalysis of a public key scheme based on a system of multivariate polynomial equations, the ”tractable rational map” cryptosystem. We show co...
CIAC
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...