13621 search results - page 162 / 2725 » Computability and Complexity in Self-assembly |
150
click to vote
UC
2005
Springer
15 years 12 months ago
2005
Springer
We present a theoretical model for self-assembling tiles with flexible branches motivated by DNA branched junction molecules. We encode an instance of a “problem” as a pot of ...
134
click to vote
AISC
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. The Complete Root Classification for a univariate polynomial with symbolic coefficients is the collection of all the possible cases of its root classification, together w...
136
click to vote
IJCAI
2003
15 years 7 months ago
2003
We propose a framework for simple causal theories of action, and study the computational complexity in it of various reasoning tasks such as determinism, progression and regressio...
176
click to vote
IJCAI
1993
15 years 7 months ago
1993
Polynomial time complexity is the usual ‘threshold’ for distinguishing the tractable from the intractable and it may seem reasonable to adopt this notion of tractability in th...
153
click to vote
MOC
2010
15 years 1 months ago
2010
We find a system of two polynomial equations in two unknowns, whose solution allows us to give an explicit expression of the conformal representation of a simply connected three-sh...