1379 search results - page 184 / 276 » The Complexity of the Annihilating Polynomial |
192
click to vote
CONSTRAINTS
2008
15 years 6 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...
195
click to vote
DISOPT
2010
15 years 6 months ago
2010
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
160
click to vote
AMAI
2006
Springer
15 years 6 months ago
2006
Springer
In this paper we study multi issue alternating-offers bargaining in a perfect information finite horizon setting, we determine the pertinent subgame perfect equilibrium, and we pro...
161
click to vote
DAM
2006
15 years 6 months ago
2006
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neigh...
165
click to vote
FUIN
2006
15 years 6 months ago
2006
Redundant call elimination has been an important program optimisation process as it can produce super-linear speedup in optimised programs. In this paper, we investigate use of the...