2766 search results - page 66 / 554 » Algorithms for trigonometric polynomials |
79
Voted
CAGD
2007
15 years 23 days ago
2007
We present an algorithm which is able to compute all roots of a given univariate polynomial within a given interval. In each step, we use degree reduction to generate a strip boun...
83
Voted
JSC
2006
15 years 21 days ago
2006
In this paper we give formulas for performing row reduction of a matrix of Ore polynomials in a fraction-free way. The reductions can be used for finding the rank and left nullspa...
125
click to vote
SODA
2012
ACM
13 years 3 months ago
2012
ACM
We give the first linear kernels for DOMINATING SET and CONNECTED DOMINATING SET problems on graphs excluding a fixed graph H as a minor. In other words, we give polynomial time...
115
Voted
MST
2011
14 years 3 months ago
2011
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σ p 2. In the case of linear matroids, which are represented over pol...
108
Voted
FOCS
1992
IEEE
15 years 4 months ago
1992
IEEE
Consider a convex set P in IRd and a piecewise polynomial concave function F: P IR. Let A be an algorithm that given a point x IRd computes F(x) if x P, or returns a concave po...