Sciweavers

2766 search results - page 260 / 554
» Algorithms for trigonometric polynomials
Sort
View
FOCM
2008
77views more  FOCM 2008»
15 years 5 months ago
Modular Counting of Rational Points over Finite Fields
Let Fq be the finite field of q elements, where q = ph. Let f(x) be a polynomial over Fq in n variables with m non-zero terms. Let N(f) denote the number of solutions of f(x) = 0 ...
Daqing Wan
COMBINATORICS
2006
98views more  COMBINATORICS 2006»
15 years 5 months ago
Shift Equivalence of P-finite Sequences
We present an algorithm which decides the shift equivalence problem for Pfinite sequences. A sequence is called P-finite if it satisfies a homogeneous linear recurrence equation w...
Manuel Kauers
132
Voted
CORR
2006
Springer
87views Education» more  CORR 2006»
15 years 5 months ago
Longest Common Pattern between two Permutations
In this paper, we give a polynomial (O(n8)) algorithm for finding a longest common pattern between two permutations of size n given that one is separable. We also give an algorithm...
Dominique Rossin, Mathilde Bouvel
COMPUTING
2007
118views more  COMPUTING 2007»
15 years 5 months ago
The construction of good extensible Korobov rules
In this paper we introduce construction algorithms for Korobov rules for numerical integration which work well for a given set of dimensions simultaneously. The existence of such ...
Josef Dick, Friedrich Pillichshammer, Benjamin J. ...
LOGCOM
2008
89views more  LOGCOM 2008»
15 years 5 months ago
Sequentially Indexed Grammars
This paper defines the grammar class of sequentially indexed grammars (SIGs) that results of a change in the index stack handling mechanism of indexed grammars [Aho68, Aho69]. SIG...
Jan van Eijck