10608 search results - page 70 / 2122 » Complexity of O'Hara's Algorithm |
IJAC
2007
13 years 10 months ago
2007
Abstract. We say the endomorphism problem is solvable for an element W in a free group F if it can be decided effectively whether, given U in F , there is an endomorphism φ of F ...
SIAMJO
2010
13 years 8 months 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...
PRL
2000
13 years 9 months ago
2000
The need to
IPL
2008
13 years 10 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...
ALGORITHMICA
2008
13 years 10 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...