1998 search results - page 321 / 400 » Complexity of the Cover Polynomial |
110
click to vote
EPIA
2007
Springer
15 years 6 months ago
2007
Springer
Recently, the logics of minimal knowledge and negation as failure MKNF [12] was used to introduce hybrid MKNF knowledge bases [14], a powerful formalism for combining open and clos...
92
Voted
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
One of the most controversial yet enduring hypotheses about what genetic algorithms (GAs) are good for concerns the idea that GAs process building-blocks. More specifically, it ha...
97
Voted
ICDT
2007
ACM
15 years 6 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...
108
Voted
ISSAC
2007
Springer
15 years 6 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...
81
Voted
PKC
2007
Springer
15 years 6 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...