1688 search results - page 2 / 338 » The Complexity of Rationalizing Matchings |
BIRTHDAY
2006
Springer
13 years 8 months ago
2006
Springer
CSE
2009
IEEE
13 years 8 months ago
2009
IEEE
There are many applications for Secure Multi-Party Computation (SMC), but practical adoption is still an issue. One reason is that the business model of the application does not m...
ISSAC
2007
Springer
13 years 11 months ago
2007
Springer
The black box algorithm for separating the numerator from the denominator of a multivariate rational function can be combined with sparse multivariate polynomial interpolation alg...
MOC
2000
13 years 4 months ago
2000
The purpose of this paper is to describe a method to determine whether a bivariate polynomial with rational coefficients is irreducible when regarded as an element in Q((x))[y], th...
ISSAC
2005
Springer
13 years 10 months ago
2005
Springer
We present algorithms that compute the linear and quadratic factors of supersparse (lacunary) bivariate polynomials over the rational numbers in polynomial-time in the input size....