13603 search results - page 319 / 2721 » On the Complexity of Computing Treelength |
145
click to vote
COCO
2009
Springer
16 years 24 days ago
2009
Springer
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
166
click to vote
FOCS
2006
IEEE
16 years 8 days ago
2006
IEEE
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
161
Voted
ANCS
2005
ACM
15 years 11 months ago
2005
ACM
We present Group Round-Robin (GRR) scheduling, a hybrid fair packet scheduling framework based on a grouping strategy that narrows down the traditional trade-off between fairness ...
159
click to vote
SPAA
2010
ACM
15 years 6 months ago
2010
ACM
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
187
Voted
EM
2010
15 years 6 months ago
2010
In this paper we enumerate and classify the "simplest" pairs (M, G) where M is a closed orientable 3-manifold and G is a trivalent graph embedded in M. To enumerate the p...