18306 search results - page 411 / 3662 » Algorithmics in Exponential Time |
165
click to vote
MST
2007
15 years 7 months ago
2007
In [Sch99], Sch¨oning proposed a simple yet efficient randomized algorithm for solving the k-SAT problem. In the case of 3-SAT, the algorithm has an expected running time of poly...
163
click to vote
JPDC
2010
15 years 2 months ago
2010
We present an efficient parallel algorithm for building the separating tree for a separable permutation. Our algorithm runs in O(log2 n) time using O(n log n) operations on the CR...
183
click to vote
CP
2004
Springer
15 years 11 months ago
2004
Springer
This paper presents an algorithm that achieves hyper-arc consistency for the soft alldifferent constraint. To this end, we prove and exploit the equivalence with a minimum-cost flo...
196
click to vote
FCS
2006
15 years 8 months ago
2006
The problem of finding a negative cycle in a weighted, directed graph is discussed here. First the algorithm for printing out a negative cycle reachable from the source s, with th...
212
click to vote
ALGORITHMICA
2008
15 years 7 months ago
2008
In this paper we present techniques to significantly improve the space complexity of several ordered tree comparison algorithms without sacrificing the corresponding time complexit...