290 search results - page 27 / 58 » Pseudorandom Bits for Polynomials |
FOCS
1995
IEEE
14 years 1 days ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
ANTS
2010
Springer
14 years 12 days ago
2010
Springer
Let p be a rational prime and let Φ(X) be a monic irreducible polynomial in Z[X], with nΦ = deg Φ and δΦ = vp(disc Φ). In [13] Montes describes an algorithm for the decomposi...
STACS
1998
Springer
14 years 21 days ago
1998
Springer
d Abstract appeared in STACS `98) Joel H. Spencer1 and Katherine St. John2 1 Courant Institute, New York University, New York, NY 10012 2 Department of Mathematics, Santa Clara Uni...
MICRO
1997
IEEE
14 years 21 days ago
1997
IEEE
High performance architectures depend heavily on efficient multi-level memory hierarchies to minimize the cost of accessing data. This dependence will increase with the expected i...
FSE
2000
Springer
14 years 3 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...