3415 search results - page 354 / 683 » Lower bounds on kernelization |
155
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We present a new example of a partial boolean function whose one-way quantum communication complexity is exponentially lower than its one-way classical communication complexity. T...
101
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
With the advent of autonomous robots with two- and three-dimensional scanning capabilities, classical visibility-based exploration methods from computational geometry have gained ...
133
click to vote
CPC
2008
15 years 6 months ago
2008
A set of integers A is called a B2[g] set if every integer m has at most g representations of the form m = a + a , with a a and a, a A. We obtain a new lower bound for F(g, n), t...
160
click to vote
DM
2010
15 years 6 months ago
2010
We introduce the concept of an edge-colouring total k-labelling. This is a labelling of the vertices and the edges of a graph G with labels 1, 2, . . . , k such that the weights o...
177
click to vote
DAM
2008
15 years 6 months ago
2008
ct The average case analysis of algorithms usually assumes independent, identical distributions for the inputs. In [?], Kenyon introduced the random-order ratio, a new average case...