231 search results - page 1 / 47 » Two lower bounds for self-assemblies at temperature 1 |
SAC
2009
ACM
14 years 6 months ago
2009
ACM
Abstract—Using the Tile Assembly Model proposed by Rothemund and Winfree, we give two lower bounds on the minimum number of tile types needed to uniquely assemble a shape at temp...
CCCG
2010
14 years 18 days ago
2010
In this paper we show how to construct in 2 rounds a line-rigid point placement graph of size 4n/3+O(1) from small graphs called 6:6 jewels, an extension of the 4:4 jewel of [3]. ...
AOR
2006
13 years 11 months ago
2006
The problem of on-line bin packing restricted to instances with only two item sizes (known in advance) has a well-known lower bound of 4/3 for its asymptotic competitive ratio. We...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
We present two general methods for proving lower bounds on the query complexity of nonadaptive quantum algorithms. Both methods are based on the adversary method of Ambainis. We sh...
COMPGEOM
2006
ACM
14 years 5 months ago
2006
ACM
Given a metric space (X, dX), c ≥ 1, r > 0, and p, q ∈ [0, 1], a distribution over mappings H : X → N is called a (r, cr, p, q)-sensitive hash family if any two points in...