494 search results - page 6 / 99 » Polynomial Equivalence Problems: Algorithmic and Theoretical... |
UAI
2008
15 years 1 months ago
2008
We present and evaluate new techniques for designing algorithm portfolios. In our view, the problem has both a scheduling aspect and a machine learning aspect. Prior work has larg...
85
Voted
IPL
2007
14 years 11 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...
98
Voted
STACS
2005
Springer
15 years 5 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...
118
click to vote
CONSTRAINTS
2008
14 years 11 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
94
Voted
COMBINATORICS
2006
14 years 11 months ago
2006
We present an algorithm which decides the shift equivalence problem for Pfinite sequences. A sequence is called P-finite if it satisfies a homogeneous linear recurrence equation w...