1379 search results - page 183 / 276 » The Complexity of the Annihilating Polynomial |
157
click to vote
AAAI
2000
15 years 7 months ago
2000
We present a new algorithm that reduces the space complexity of heuristic search. It is most effective for problem spaces that grow polynomially with problem size, but contain lar...
159
click to vote
GECCO
2008
Springer
15 years 7 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...
177
click to vote
AAECC
2010
Springer
15 years 6 months 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...
171
click to vote
APAL
2008
15 years 6 months 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 ...
128
click to vote
CORR
2010
Springer
15 years 6 months 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...