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

On algorithmic complexity of finding the residue of division by a power of 2 of the weight of a Boolean function defined by a polynomial

โœ Scribed by S. N. Selezneva

Book ID
111496965
Publisher
Allerton Press, Inc.
Year
2007
Tongue
English
Weight
113 KB
Volume
31
Category
Article
ISSN
0278-6419

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the Zeros of a Class of Polynomials D
On the Zeros of a Class of Polynomials Defined by a Three Term Recurrence Relation
โœ E.K. Ifantis; P.N. Panagopoulos ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 316 KB

Let \(P\_{N+1}(x)\) be the polynomial which is defined recursively by \(P\_{0}(x)=0\), \(P\_{1}(x)=1, \quad\) and \(\alpha\_{n} P\_{n+1}(x)+\alpha\_{n-1} P\_{n-1}(x)+b\_{n} P\_{n}(x)=x d\_{n} P\_{n}(x), \quad n=1, \quad 2, \ldots, N\), where \(\alpha\_{n}, b\_{n}, d\_{n}\) are real sequences with \(