457 search results - page 55 / 92 » Upper and Lower Bounds on Continuous-Time Computation |
178
click to vote
FOCS
1998
IEEE
15 years 10 months ago
1998
IEEE
We prove an exponential lower bound for tree-like Cutting Planes refutations of a set of clauses which has polynomial size resolution refutations. This implies an exponential sepa...
191
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
Distributed Lagrangian Relaxation Protocol (DisLRP) has been proposed to solve a distributed combinatorial maximization problem called the Generalized Mutual Assignment Problem (G...
190
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
In the cyclic-to-random shuffle, we are given n cards arranged in a circle. At step k, we exchange the k'th card along the circle with a uniformly chosen random card. The pro...
170
click to vote
ALGORITHMICA
1998
15 years 6 months ago
1998
Abstract. We study some minimum-area hull problems that generalize the notion of convex hull to starshaped and monotone hulls. Specifically, we consider the minimum-area star-shap...
161
click to vote
LATA
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We consider the efficient simplification of regular expressions and suggest a quantitative comparison of heuristics for simplifying regular expressions. To this end, we...