1552 search results - page 53 / 311 » On the Complexity of Constant Propagation |
116
click to vote
IWPEC
2009
Springer
15 years 8 months ago
2009
Springer
We describe a framework for expressing the complexity of algorithms for FPT problems with two separate parameters k, m and with exponential time bounds O∗ (xk ym ) where x, y &g...
102
click to vote
COCOON
2005
Springer
15 years 7 months ago
2005
Springer
The Satisfactory Partition problem consists of deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighb...
105
click to vote
COCO
2001
Springer
15 years 6 months ago
2001
Springer
We study the complexity of approximating the VC dimension of a collection of sets, when the sets are encoded succinctly by a small circuit. We show that this problem is • Σp 3-...
110
click to vote
ISAAC
2001
Springer
15 years 6 months ago
2001
Springer
A fragmentary pattern is a multiset of non-empty strings, and it matches a string w if all the strings in it occur within w without any overlaps. We study some fundamental issues o...
104
click to vote
COMPSAC
2004
IEEE
15 years 5 months ago
2004
IEEE
Emerging patterns have been studied as a useful type of pattern for the diagnosis and understanding of diseases based on the analysis of gene expression profiles. They are useful ...