✦ LIBER ✦

The complexity of sparse polynomial interpolation over finite fields

✍ Scribed by Kai Werther

Publisher: Springer
Year: 1994
Tongue: English
Weight: 650 KB
Volume: 5
Category: Article
ISSN: 0938-1279
DOI: 10.1007/bf01438278

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Noisy interpolation of sparse polynomial

Noisy interpolation of sparse polynomials in finite fields

✍ Igor Shparlinski; Arne Winterhof 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 160 KB

On zero-testing and interpolation of k-s

On zero-testing and interpolation of k-sparse multivariate polynomials over finite fields

✍ Michael Clausen; Andreas Dress; Johannes Grabmeier; Marek Karpinski 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 848 KB

Polynomial multiplication over finite fi

Polynomial multiplication over finite fields: from quadratic to straight-line complexity

✍ Nader H. Bshouty; Michael Kaminski 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 171 KB

On the deterministic complexity of facto

On the deterministic complexity of factoring polynomials over finite fields

✍ Victor Shoup 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 792 KB

The rank of sparse random matrices over

The rank of sparse random matrices over finite fields

✍ Johannes Blömer; Richard Karp; Emo Welzl 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 182 KB 👁 2 views

Let M be a random n = n -matrix over GF q such that for each entry M in i j w x Ž . M and for each nonzero field element ␣ the probability Pr M s ␣ is pr q y 1 , where i j ## Ž . p slog n y c rn and c is an arbitrary but fixed positive constant. The probability for a Ž . matrix entry to be zero

Communication complexity of matrix compu

Communication complexity of matrix computation over finite fields

✍ J. I. Chu; G. Schnitger 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 764 KB