308 search results - page 12 / 62 » Tight Lower Bounds for the Distinct Elements Problem |
154
click to vote
COMPGEOM
2010
ACM
15 years 9 months ago
2010
ACM
d Abstract] György Elekes Eötvös University Micha Sharir Tel Aviv University and New York University We first describe a reduction from the problem of lower-bounding the numbe...
125
click to vote
ICALP
1992
Springer
15 years 8 months ago
1992
Springer
Abstract Bernard Chazelle Department of Computer Science Princeton University Burton Rosenberg Department of Mathematics and Computer Science Dartmouth College We give a lower bou...
154
click to vote
STOC
2006
ACM
16 years 4 months ago
2006
ACM
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
131
click to vote
COMBINATORICA
2007
15 years 3 months ago
2007
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...
118
click to vote
APPROX
2007
Springer
15 years 8 months ago
2007
Springer
We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time (t2 )...