1383 search results - page 55 / 277 » On the Complexity of the Interlace Polynomial |
139
click to vote
ICC
2007
IEEE
16 years 15 days ago
2007
IEEE
—In this paper we propose an interference detection technique for detecting time varying jamming signals in spread spectrum communication systems. The technique is based on Discr...
149
click to vote
ISSAC
2004
Springer
15 years 11 months ago
2004
Springer
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...
157
click to vote
ANTS
2006
Springer
15 years 10 months ago
2006
Springer
We provide a modular method for computing the splitting field Kf of an integral polynomial f by suitable use of the byproduct of computation of its Galois group Gf by p-adic Staudu...
184
click to vote
ISAAC
2010
Springer
15 years 4 months ago
2010
Springer
We consider the problem of finding a sparse multiple of a polynomial. Given f F[x] of degree d, and a desired sparsity t, our goal is to determine if there exists a multiple h F[...
145
click to vote
TIT
2010
15 years 26 days ago
2010
Abstract--We consider Laurent polynomial (LP) matrices defined on the unit circle of the complex plane. QR decomposition of an LP matrix A(s) yields QR factors Q(s) and R(s) that, ...