2957 search results - page 120 / 592 » The Complexity of Polynomial-Time Approximation |
PPL
2007
13 years 9 months ago
2007
JC
2000
13 years 10 months ago
2000
We study the complexity of approximating the Stieltjes integral R 1 0 f(x)dg(x) for functions f having r continuous derivatives and functions g whose sth derivative has bounded va...
DAM
2010
13 years 10 months ago
2010
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...
AAAI
2008
14 years 14 days ago
2008
This paper considers the problem of an agent searching for a resource or a tangible good in a physical environment, where at each stage of its search it observes one source where ...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Bidimensionality theory appears to be a powerful framework for the development of metaalgorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...