1383 search results - page 220 / 277 » On the Complexity of the Interlace Polynomial |
109
click to vote
ICDT
2007
ACM
15 years 8 months ago
2007
ACM
Abstract. In many cases, users may want to consider incomplete answers to their queries. Often, however, there is an overwhelming number of such answers, even if subsumed answers a...
115
click to vote
ISSAC
2007
Springer
15 years 8 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...
PKC
2007
Springer
15 years 8 months ago
2007
Springer
Damg˚ard et al. [11] showed a novel technique to convert a polynomial sharing of secret a into the sharings of the bits of a in constant rounds, which is called the bit-decomposit...
WABI
2007
Springer
15 years 8 months ago
2007
Springer
Graph-theoretic models have come to the forefront as some of the most powerful and practical methods for sequence assembly. Simultaneously, the computational hardness of the underl...
119
click to vote
BROADNETS
2006
IEEE
15 years 8 months ago
2006
IEEE
— We introduce a new algorithmic framework for advanced channel reservation in ultra high speed networks, called Graded Channel Reservation (GCR). GCR allows users to specify min...