2957 search results - page 15 / 592 » The Complexity of Polynomial-Time Approximation |
ALMOB
2008
13 years 7 months ago
2008
Background: In recent years, quartet-based phylogeny reconstruction methods have received considerable attentions in the computational biology community. Traditionally, the accura...
CCA
2009
Springer
14 years 2 months ago
2009
Springer
d Abstract) Robert Rettinger1 Department of Mathematics and Computer Science University of Hagen, Germany Abstract. We show that under reasonable assumptions there exist Riemann ma...
SIGACT
2010
13 years 5 months ago
2010
A fundamental question in complexity theory is whether every randomized polynomial time algorithm can be simulated by a deterministic polynomial time algorithm (that is, whether B...
RECOMB
1997
Springer
13 years 11 months ago
1997
Springer
The paper studies the computational complexity and approximation algorithms for a new evolutionary distance between multi-chromosomal genomes introduced recently by Ferretti, Nade...
IANDC
1998
13 years 7 months ago
1998
We show that restricting a number of characterizations of the complexity class P to be positive (in natural ways) results in the same class of (monotone) problems which we denote ...