✦ LIBER ✦

The interpolation problem for k-sparse polynomials and character sums

✍ Scribed by Andreas Dress; Johannes Grabmeier

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 916 KB
Volume: 12
Category: Article
ISSN: 0196-8858
DOI: 10.1016/0196-8858(91)90004-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The interpolation problem for k-sparse s

The interpolation problem for k-sparse sums of eigenfunctions of operators

✍ Dima Yu Grigoriev; Marek Karpinski; Michael F Singer 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 279 KB

Incomplete Character Sums and Polynomial

Incomplete Character Sums and Polynomial Interpolation of the Discrete Logarithm

✍ Harald Niederreiter; Arne Winterhof 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 99 KB

In the "rst part of the paper, certain incomplete character sums over a "nite "eld F N P are considered which in the case of "nite prime "elds F N are of the form , where A and N are integers with 14N(p, g and f are polynomials over F N , and denotes a multiplicative and an additive character of F

The complexity of some polynomial networ

The complexity of some polynomial network consistency algorithms for constraint satisfaction problems: A.K. Mackworth and E.C. Freuder [Artificial Intelligence 25 (1) (1985) 65–74]

📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 35 KB