231 search results - page 27 / 47 » Two lower bounds for self-assemblies at temperature 1 |
106
Voted
STOC
2010
ACM
15 years 6 months ago
2010
ACM
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
101
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
CORR
2011
Springer
14 years 1 months ago
2011
Springer
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
114
click to vote
COMGEO
2011
ACM
14 years 4 months ago
2011
ACM
Let P be a set of n points in the plane. A geometric proximity graph on P is a graph where two points are connected by a straight-line segment if they satisfy some prescribed prox...
CAGD
2010
14 years 9 months ago
2010
This paper derives strong relations that boundary curves of a smooth complex of patches have to obey when the patches are computed by local averaging. These relations restrict the...