Sciweavers

2766 search results - page 15 / 554
» Algorithms for trigonometric polynomials
Sort
View
ESOP
2010
Springer
14 years 5 months ago
Amortized Resource Analysis with Polynomial Potential - A Static Inference of Polynomial Bounds for Functional Programs
In 2003, Hofmann and Jost introduced a type system that uses a potential-based amortized analysis to infer bounds on the resource consumption of (first-order) functional programs. ...
Jan Hoffmann and Martin Hofmann
MST
2010
105views more  MST 2010»
13 years 6 months ago
On the Automatizability of Polynomial Calculus
Abstract We prove that Polynomial Calculus and Polynomial Calculus with Resolution are not automatizable, unless W[P]-hard problems are fixed parameter tractable by one-side error...
Nicola Galesi, Massimo Lauria
CORR
2010
Springer
69views Education» more  CORR 2010»
13 years 8 months ago
Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time
In this paper we study planar polynomial differential systems of this form: dX dt = X = A(X, Y ), dY dt = Y = B(X, Y ), where A, B Z[X, Y ] and deg A d, deg B d, A H and B H. ...
Guillaume Chèze
ESA
2009
Springer
131views Algorithms» more  ESA 2009»
14 years 3 months ago
Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
Abstract. We show that the k-Dominating Set problem is fixed parameter tractable (FPT) and has a polynomial kernel for any class of
Geevarghese Philip, Venkatesh Raman, Somnath Sikda...
ANTS
2010
Springer
265views Algorithms» more  ANTS 2010»
13 years 11 months ago
Factoring Polynomials over Local Fields II
Sebastian Pauli