747 search results - page 6 / 150 » Theory and Construction of Molecular Computers |
JCC
2007
13 years 7 months ago
2007
Abstract: The relative aromaticity of benzenoid rings in the linear polyacenes is investigated using two novel aromaticity approaches. According to the first, the aromaticity of i...
FSTTCS
2009
Springer
14 years 2 months ago
2009
Springer
The rigidity of a matrix A for target rank r is the minimum number of entries of A that
EC
1998
13 years 7 months ago
1998
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...
COMPGEOM
2005
ACM
13 years 9 months ago
2005
ACM
We present an efficient algorithm for maintaining the boundary and surface area of protein molecules as they undergo conformational changes. We also describe a robust implementati...
DCC
2006
IEEE
14 years 7 months ago
2006
IEEE
So far there is no systematic attempt to construct Boolean functions with maximum annihilator immunity. In this paper we present a construction keeping in mind the basic theory of...