787 search results - page 40 / 158 » Polynomial Constants are Decidable |
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
We obtain a polynomial time approximation scheme for the terrain guarding problem improving upon several recent constant factor approximations. Our algorithm is a local search algo...
APPROX
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We study the problem embedding an n-point metric space into another n-point metric space while minimizing distortion. We show that there is no polynomial time algorithm t...
CHES
2005
Springer
14 years 1 months ago
2005
Springer
The Truncated Multiplication computes a truncated product, a contiguous subsequence of the digits of the product of 2 integers. A few truncated polynomial multiplication algorithms...
RECOMB
1997
Springer
14 years 5 days ago
1997
Springer
We present a new polynomial time approximation scheme (PTAS) for tree alignment, which is an important variant of multiple sequence alignment. As in the existing PTASs in the liter...
JAT
2006
13 years 8 months ago
2006
We give a simple, geometric and explicit construction of bivariate interpolation at certain points in a square (called Padua points), giving compact formulas for their fundamental...