13621 search results - page 139 / 2725 » Computability and Complexity in Self-assembly |
176
click to vote
CGI
2006
IEEE
15 years 10 months ago
2006
IEEE
Rendering the structural color of natural objects or modern industrial products in the 3D environment is not possible with RGBbased graphics platforms and software and very time co...
157
click to vote
SOFSEM
2009
Springer
16 years 3 months ago
2009
Springer
During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road net...
180
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
Motivated by the quantum algorithm for testing commutativity of black-box groups (Magniez and Nayak, 2007), we study the following problem: Given a black-box finite ring by an add...
176
click to vote
IWPEC
2009
Springer
16 years 29 days ago
2009
Springer
We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension d: i) Given n points in Rd, compute their minimum enclosing cyl...
158
click to vote
CSR
2006
Springer
15 years 10 months ago
2006
Springer
We classify the computational complexity of all constraint satisfaction problems where the constraint language is preserved by all permutations of the domain. A constraint languag...