2924 search results - page 250 / 585 » Lower Bounds in Distributed Computing |
115
click to vote
COMBINATORICS
2000
15 years 3 months ago
2000
The set R of relevant cycles of a graph G is the union of its minimum cycle bases. We introduce a partition of R such that each cycle in a class W can be expressed as a sum of oth...
118
click to vote
IJBC
2002
15 years 3 months ago
2002
We give a method for finding symbolic dynamics for a planar diffeomorphism with a homoclinic tangle. The method only requires a finite piece of tangle, which can be computed with ...
137
click to vote
MP
2010
14 years 10 months ago
2010
We consider semidefinite programming relaxations of the quadratic assignment problem, and show how to exploit group symmetry in the problem data. Thus we are able to compute the b...
203
click to vote
CALCO
2011
Springer
14 years 4 months ago
2011
Springer
Abstract. We propose a probabilistic interpretation of a class of reversible communicating processes. The rate of forward and backward computing steps, instead of being given expli...
130
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
Abstract. We consider the issue of exploiting symmetries in the hierarchy of semidefinite programming relaxations recently introduced in polynomial optimization. We focus on probl...