1998 search results - page 17 / 400 » Complexity of the Cover Polynomial |
238
click to vote
ISSAC
2011
Springer
14 years 7 months ago
2011
Springer
There are several algorithms for factoring in Z[x] which have a proven polynomial complexity bound such as Sch¨onhage of 1984, Belabas/Kl¨uners/van Hoeij/Steel of 2004, and vanH...
152
click to vote
CMA
2010
15 years 1 months ago
2010
Complex Multiplication (CM) method is a frequently used method for the generation of elliptic curves (ECs) over a prime field Fp. The most demanding and complex step of this metho...
153
click to vote
TWC
2010
14 years 11 months ago
2010
Abstract--We prove that maximum-likelihood (ML) noncoherent sequence detection of orthogonal space-time block coded signals can always be performed in polynomial time with respect ...
120
click to vote
ISSAC
2004
Springer
15 years 10 months ago
2004
Springer
Many polynomial factorization algorithms rely on Hensel lifting and factor recombination. For bivariate polynomials we show that lifting the factors up to a precision linear in th...
149
Voted
CSR
2009
Springer
15 years 11 months ago
2009
Springer
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 poly...