13621 search results - page 14 / 2725 » Computability and Complexity in Self-assembly |
127
click to vote
CSR
2011
Springer
14 years 2 months ago
2011
Springer
The Goldreich’s function has n binary inputs and n binary outputs. Every output depends on d inputs and is computed from them by the fixed predicate of arity d. Every Goldreich...
COMPLEXITY
2007
14 years 10 months ago
2007
Distributed computing systems are becoming bigger and more complex. While the complexity of large-scale distributed systems has been acknowledged to be an important challenge, the...
VIS
2007
IEEE
15 years 12 months ago
2007
IEEE
The Morse-Smale complex is an efficient representation of the gradient behavior of a scalar function, and critical points paired by the complex identify topological features and th...
CVPR
2007
IEEE
16 years 20 days ago
2007
IEEE
184
click to vote
Book
"This book is about data structures and algorithms, intermediate programming in Python, complexity science and the philosophy of science"