1322 search results - page 112 / 265 » Parameterized counting problems |
ISSAC
1999
Springer
14 years 1 months ago
1999
Springer
In this paper we study the generic setting of the modular GCD algorithm. We develop the algorithm for multivariate polynomials over Euclidean domains which have a special kind of ...
CEC
2007
IEEE
14 years 29 days ago
2007
IEEE
XCS with Computed Action, briefly XCSCA, is a recent extension of XCS to tackle problems involving a large number of discrete actions. In XCSCA the classifier action is computed wi...
ACL
2008
13 years 10 months ago
2008
In this work, the problem of extracting phrase translation is formulated as an information retrieval process implemented with a log-linear model aiming for a balanced precision an...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
We present an efficient solution to the following problem, of relevance in a numerical optimization scheme: calculation of integrals of the type ZZ T {f0} 12 dx dy for quadratic p...
IPL
2007
13 years 8 months ago
2007
We consider the problem Monet—given two monotone formulas ϕ in DNF and ψ in CNF, decide whether they are equivalent. While Monet is probably not coNPhard, it is a long standin...