1004 search results - page 38 / 201 » Product representations of polynomials |
BMCBI
2007
13 years 8 months ago
2007
Background: In the context of genomic association studies, for which a large number of statistical tests are performed simultaneously, the local False Discovery Rate (lFDR), which...
FSE
2000
Springer
14 years 1 days ago
2000
Springer
Abstract. The complexity of interpolation attacks on block ciphers depends on the degree of the polynomial approximation and or on the number of terms in the polynomial approximati...
STOC
2010
ACM
14 years 5 months ago
2010
ACM
In this paper we study the computational complexity of computing the noncommutative determinant. We first consider the arithmetic circuit complexity of computing the noncommutativ...
ICSM
2003
IEEE
14 years 1 months ago
2003
IEEE
The use of product lines is recognized as beneficial in promoting and structuring both component and architecture reuse throughout an organization. While the business practices of...
ISSAC
2009
Springer
14 years 3 months ago
2009
Springer
In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects, we call m-schemes, that are generalizations o...