On the behavior of tile assembly system at high temperatures

Shinnosuke Seki; Yasushi Okuno

Home/Archive/arXiv

arXiv · 1211.4949

On the behavior of tile assembly system at high temperatures

Shinnosuke Seki·Yasushi Okuno

View original source ↗Read source document ↗Export metadata ↓

Abstract

Behaviors of Winfree's tile assembly systems (TASs) at high temperatures are investigated in combination with integer programming of a specific form called threshold programming. First, we propose a way to build bridges from the Boolean satisfiability problem (SAT) to threshold programming, and further to TAS's behavior, in order to prove the NP-hardness of optimizing temperatures of TASs that behave in a way given as input. These bridges will take us further to two important results on the behavior of TASs at high temperatures. The first says that arbitrarily high temperatures are required to assemble some shape by a TAS of "reasonable" size. The second is that for any temperature at least 4 given as a parameter, it is NP-hard to find the minimum size TAS that self-assembles a given shape and works at the given temperature or below.

Explore related subjects

cs.CC cs.DM

Keep this discovery

BibTeX RIS

Shinnosuke Seki, Yasushi Okuno. 2012-11-21. On the behavior of tile assembly system at high temperatures. https://arxiv.org/abs/1211.4949

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$

The Holant framework provides a general setting for studying counting problems and includes graph homomorphisms (\#GH) and counting constraint satisfaction problems (\#CSP) as special cases. Over the past twenty years, a series of computational complexity dichotomies have been established for Holant problems, but the classification for complex-valued signatures is still open. The main obstacle is the case in which all signatures have even arity. In this paper, we establish a dichotomy for Holant problems with a complex-valued 4-ary signature, which is a key base case for the full classification of Holant problems. We present a new strategy by introducing Schur's theorem, the classification of finite subgroups of $\mathrm{SL}(2,\mathbb{C})$ and stable subgroup sequences into the proof. These new techniques are of independent interest.

cs.CC↗

arXiv2026

Max Independent Set Remains NP-hard when Excluding a Planar Induced Minor

We show that there is a fixed planar graph $H$, namely the $5 \times 5$ grid, such that Max Independent Set remains NP-hard in $H$-induced-minor-free graphs. This refutes the Dallard--Milani\v{c}--\v{S}torgel conjecture and a weakening of it by Gartland and Lokshtanov, and by Korhonen.

cs.CC↗

arXiv2026

Topology inside NC$^1$

We show that ACC$^0$ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC$^0$. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that constant-width circuits of polynomial size and thickness two already suffice to capture all of NC$^1$.

cs.CC↗