900 search results - page 14 / 180 » On Polynomial Time Computation over Unordered Structures |
120
click to vote
AAAI
2012
13 years 4 months ago
2012
Knowledge transfer is computationally challenging, due in part to the curse of dimensionality, compounded by source and target domains expressed using different features (e.g., do...
116
Voted
STACS
2005
Springer
15 years 7 months ago
2005
Springer
The subset sum problem (SSP) (given n numbers and a target bound B, find a subset of the numbers summing to B), is one of the classical NP-hard problems. The hardness of SSP vari...
136
click to vote
BIRTHDAY
2010
Springer
15 years 3 months ago
2010
Springer
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
133
Voted
ICALP
2010
Springer
15 years 6 months ago
2010
Springer
We say that a polynomial f(x1, . . . , xn) is indecomposable if it cannot be written as a product of two polynomials that are defined over disjoint sets of variables. The polynom...
108
click to vote
FLAIRS
2003
15 years 3 months ago
2003
We extend the differential approach to inference in Bayesian networks (BNs) (Darwiche, 2000) to handle specific problems that arise in the context of dynamic Bayesian networks (D...