1004 search results - page 28 / 201 » Product representations of polynomials |
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
We give a polynomial time algorithm that computes a decomposition of a finite group G given in the form of its multiplication table. That is, given G, the algorithm outputs two su...
COCO
2007
Springer
14 years 1 months ago
2007
Springer
This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and GF(2) polynomials. The key is t...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
A strong direct product theorem (SDPT) states that solving n instances of a problem requires ˝.n/ times the resources for a single instance, even to achieve success probability 2 ...
DSP
2006
13 years 7 months ago
2006
This paper presents an algorithm for estimating the parameters of multicomponent chirp signals. The estimator is based on the cubic phase function (CPF), which is efficient to est...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
We want to achieve efficiency for the exact computation of the dot product of two vectors over word size finite fields. We therefore compare the practical behaviors of a wide range...