2430 search results - page 38 / 486 » Computing Tutte Polynomials |
TSP
2008
13 years 10 months ago
2008
Recently, new polynomial approximation formulas were proposed for the reconstruction of compactly supported piecewise smooth functions from Fourier data. Formulas for zero and firs...
FCT
1999
Springer
14 years 2 months ago
1999
Springer
Abstract. It is proved that everywhere-dense Min 2SAT and everywheredense Min Eq both have polynomial time approximation schemes.
GC
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. In this paper we establish two symmetric identities on sums of products of Euler polynomials.
COMPUTING
2006
13 years 10 months ago
2006
In his paper "Lagrange interpolation on Chebyshev points of two variables" (J. Approx. Theor. 87, 220
RTA
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. We show how polynomial path orders can be employed efficiently in conjunction with weak innermost dependency pairs to automatically certify the polynomial runtime comple...