1998 search results - page 395 / 400 » Complexity of the Cover Polynomial |
CGF
2005
13 years 9 months ago
2005
We present a novel framework for the efficient simulation and animation of discrete thin shells. Our method takes a point sampled surface as input and performs all necessary compu...
TVLSI
2008
13 years 9 months ago
2008
Abstract--The quantum-dot cellular automata (QCA) model offers a novel nano-domain computing architecture by mapping the intended logic onto the lowest energy configuration of a co...
TWC
2008
13 years 9 months ago
2008
With the capability of supporting very high data rate services in a short range, Ultra-Wideband (UWB) technology is appealing to multimedia applications in future wireless personal...
BMCBI
2004
13 years 9 months ago
2004
Background: The general problem of RNA secondary structure prediction under the widely used thermodynamic model is known to be NP-complete when the structures considered include a...
CORR
1999
Springer
13 years 9 months ago
1999
Springer
: In the early 1980s, Selman's seminal work on positive Turing reductions showed that positive Turing reduction to NP yields no greater computational power than NP itself. Thu...