10988 search results - page 26 / 2198 » Algorithmic Folding Complexity |
CCCG
2010
13 years 10 months ago
2010
We explore which polyhedra and polyhedral complexes can be formed by folding up a planar polygonal region and fastening it with one zipper. We call the reverse process a zipper un...
COCOA
2011
Springer
12 years 8 months ago
2011
Springer
The work in this paper is to initiate a theory of testing monomials in multivariate polynomials. The central question is to ask whether a polynomial represented by certain economi...
JCB
2000
13 years 8 months ago
2000
We present an implementation of McCaskill's algorithm for computing the base pair probabilities of an RNA molecule for massively parallel message passing architectures. The p...
COCO
2005
Springer
14 years 2 months ago
2005
Springer
We study the complexity of approximating Max NME3SAT, a variant of Max 3SAT when the instances are guaranteed to not have any mixed clauses, i.e., every clause has either all its ...
WCC
2005
Springer
14 years 2 months ago
2005
Springer
In this paper, we describe a broad class of problems arising in the context of designing codes for DNA computing. We primarily focus on design considerations pertaining to the phen...