1092 search results - page 56 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
143
click to vote
BMCBI
2006
15 years 5 months ago
2006
Affymetrix microarrays have become a standard experimental platform for studies of mRNA expression profiling. Their success is due, in part, to the multiple oligonucleotide featur...
167
Voted
ESA
2009
Springer
16 years 11 days ago
2009
Springer
In this paper, we give evidence for the problems Disjoint Cycles and Disjoint Paths that they cannot be preprocessed in polynomial time such that resulting instances always have a ...
152
click to vote
CORR
2002
Springer
15 years 5 months ago
2002
Springer
The Inductive Logic Programming community has considered proof-complexity and model-complexity, but, until recently, size-complexity has received little attention. Recently a chal...
171
click to vote
DAGSTUHL
2006
15 years 7 months ago
2006
We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...
153
Voted
MST
2008
15 years 5 months ago
2008
We investigate the complexity of the satisfiability problem of constraints over finite totally ordered domains. In our context, a clausal constraint is a disjunction of inequaliti...