13621 search results - page 185 / 2725 » Computability and Complexity in Self-assembly |
149
click to vote
STACS
2007
Springer
16 years 18 days ago
2007
Springer
This paper is motivated by the open question whether the union of two disjoint NPcomplete sets always is NP-complete. We discover that such unions retain much of the complexity of...
178
click to vote
IMR
1998
Springer
15 years 10 months ago
1998
Springer
High reynolds number ow simulations exhibit strong gradients normal to walls and across shear layers requiring much ner resolution of the solution in some directions compared to o...
156
click to vote
FOCS
1990
IEEE
15 years 10 months ago
1990
IEEE
The exponent of periodicity is an important factor in estimates of complexity of word-unification algorithms. We prove that the exponent of periodicity of a minimal solution of a w...
169
click to vote
BIRTHDAY
2006
Springer
15 years 10 months ago
2006
Springer
This essay draws on participant observation, ethnographic interviews, phenomenological inquiry, and recent insights from the study of swarm intelligence and complex networks to ill...
171
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
We introduce the SoftAllEqual global constraint, which maximizes the number of equalities holding between pairs of assignments to a set of variables. We study the computational com...