Login / Signup
Improved lower and upper bounds on the tile complexity of uniquely self-assembling a thin rectangle non-cooperatively in 3D.
David Furcy
Scott M. Summers
Logan Withers
Published in:
CoRR (2020)
Keyphrases
</>
lower and upper bounds
lower bound
upper bound
lower bounding
upper and lower bounds
cooperative
lagrangian relaxation
valid inequalities
computational complexity
dynamic programming
worst case
line segments
itemsets
hough transform
branch and bound algorithm
branch and bound
data streams