10988 search results - page 124 / 2198 » Algorithmic Folding Complexity |
129
Voted
SIAMJO
2010
15 years 28 days ago
2010
The imposition of general disjunctions of the form “πx ≤ π0 ∨ πx ≥ π0 + 1”, where π, π0 are integer valued, is a fundamental operation in both the branch-and-bound...
94
Voted
PRL
2000
15 years 2 months ago
2000
The need to
IPL
2008
15 years 2 months ago
2008
We describe a new algorithm for the problem of perfect sorting a signed permutation by reversals. The worst-case time complexity of this algorithm is parameterized by the maximum p...
121
Voted
ALGORITHMICA
2008
15 years 2 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...
93
Voted
STOC
1992
ACM
15 years 6 months ago
1992
ACM
Paul Beame Joan Lawry Department of Computer Science and Engineering, FR-35 University of Washington Seattle, Washington 98195 Our main result is the demonstration of a Boolean fu...