๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Complexity of some arithmetic problems for binary polynomials

โœ Scribed by Eric Allender; Anna Bernasconi; Carsten Damm; Joachim Gathen; Michael Saks; Igor Shparlinski


Publisher
Springer
Year
2003
Tongue
English
Weight
334 KB
Volume
12
Category
Article
ISSN
1016-3328

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Some extremal problems for trigonometric
โœ Eduard Belinsky ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 164 KB

Three extremal problems for trigonometric polynomials are studied in this paper. The first was initiated by Maiorov. It relates to the trigonometric polynomials with n nonzero harmonics. The L p -norm of the Weyl derivative is compared with the L q -norm of the polynomial. The other two problems hav