1998 search results - page 355 / 400 » Complexity of the Cover Polynomial |
CA
1999
IEEE
14 years 2 months ago
1999
IEEE
The continuously increasing complexity of computer animationsmakes it necessary to rely on the knowledge of various experts to cover the different areas of computer graphics and a...
COCO
2004
Springer
14 years 1 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
ISMB
2000
13 years 11 months ago
2000
Several microarray technologies that monitor the level of expression of a large number of genes have recently emerged. Given DNA-microarray data for a set of cells characterized b...
BMCBI
2010
13 years 10 months ago
2010
Background: Complex human diseases are often caused by multiple mutations, each of which contributes only a minor effect to the disease phenotype. To study the basis for these com...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...