986 search results - page 28 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
159
Voted
FOCS
1998
IEEE
15 years 8 months ago
1998
IEEE
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
135
Voted
ESA
2004
Springer
15 years 9 months ago
2004
Springer
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all ...
121
Voted
COCO
2007
Springer
15 years 10 months ago
2007
Springer
We consider the k-layer pointer jumping problem in the one-way multi-party number-on-the-forehead communication model. Sufficiently strong lower bounds for the problem would have...
130
Voted
FAW
2009
Springer
15 years 8 months ago
2009
Springer
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca...
127
Voted
COCOON
2006
Springer
15 years 7 months ago
2006
Springer
In a recent article, Nakhleh, Ringe and Warnow introduced perfect phylogenetic networks--a model of language evolution where languages do not evolve via clean speciation--and form...