13621 search results - page 123 / 2725 » Computability and Complexity in Self-assembly |
163
click to vote
COCOON
2006
Springer
15 years 10 months ago
2006
Springer
We study the complexity of some computational problems on finite black-box rings whose elements are encoded as strings of a given length and the ring operations are performed by a ...
162
click to vote
RECOMB
2004
Springer
16 years 6 months ago
2004
Springer
Protein-protein interactions, which form the basis for most cellular processes, result in the formation of protein interfaces. Believing that the local shape of proteins is crucia...
149
click to vote
STOC
1996
ACM
15 years 10 months ago
1996
ACM
We study the complexity of computing Boolean functions using AND, OR and NOT gates. We show that a circuit of depth d with S gates can be made to output a constant by setting O(S1...
194
click to vote
COMPUTING
2010
15 years 3 months ago
2010
In this paper, we introduce and analyze a modification of the Hermitian and skewHermitian splitting iteration method for solving a broad class of complex symmetric linear systems....
170
click to vote
ICANN
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. The growth in amount of data available today has encouraged the development of effective data analysis methods to support human decision-making. Neuro-fuzzy computation ...