1998 search results - page 253 / 400 » Complexity of the Cover Polynomial |
98
Voted
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
107
Voted
AAECC
2010
Springer
15 years 29 days ago
2010
Springer
The aim of this paper is a comprehensive presentation of the geometrical tools which are necessary to prove the correctness of several up to date algorithms with intrinsic complex...
110
Voted
APAL
2008
15 years 29 days ago
2008
We develop and study the complexity of propositional proof systems of varying strength extending resolution by allowing it to operate with disjunctions of linear equations instead ...
78
Voted
CORR
2010
Springer
15 years 28 days ago
2010
Springer
Regular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of polynomial systems. This paper proposes adaptations o...
130
Voted
CONSTRAINTS
2008
15 years 28 days ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...