Sciweavers

2766 search results - page 63 / 554
» Algorithms for trigonometric polynomials
Sort
View
CAP
2010
14 years 10 months ago
Parallel sparse polynomial division using heaps
We present a parallel algorithm for exact division of sparse distributed polynomials on a multicore processor. This is a problem with significant data dependencies, so our solutio...
Michael B. Monagan, Roman Pearce
111
Voted
IPCO
2001
95views Optimization» more  IPCO 2001»
15 years 5 months ago
Bisubmodular Function Minimization
This paper presents the first combinatorial polynomial algorithm for minimizing bisubmodular functions, extending the scaling algorithm for submodular function minimization due to ...
Satoru Fujishige, Satoru Iwata
108
Voted
FOCS
2004
IEEE
15 years 7 months ago
Testing Low-Degree Polynomials over Prime Fields
We present an efficient randomized algorithm to test if a given function f : Fn p Fp (where p is a prime) is a low-degree polynomial. This gives a local test for Generalized Reed...
Charanjit S. Jutla, Anindya C. Patthak, Atri Rudra...
CASC
2009
Springer
130views Mathematics» more  CASC 2009»
15 years 10 months ago
Code Generation for Polynomial Multiplication
We discuss the family of “divide-and-conquer” algorithms for polynomial multiplication, that generalize Karatsuba’s algorithm. We give explicit versions of transposed and sho...
Ling Ding, Éric Schost
113
Voted
DM
1998
56views more  DM 1998»
15 years 3 months ago
Factoring cardinal product graphs in polynomial time
In this paper a polynomial algorithm for the prime factorization of finite, connected nonbipartite graphs with respect to the cardinal product is presented. This algorithm also d...
Wilfried Imrich