Article
Licensed
Unlicensed
Requires Authentication
On the complexity of realisation of Zhegalkin polynomials
-
R. N. Zabaluev
Published/Copyright:
June 1, 2004
We show that the complexity of a Zhegalkin polynomial of degree k, 2 ≤ k ≤ n, does not exceed
(as n → ∞) and asymptotically coincides with this number for almost all such polynomials. We also show that the complexity of any homogeneous Zhegalkin polynomial of degree k (for most values of k) does not exceed
(as n → ∞) and asymptotically coincides with this number for almost all such polynomials.
Published Online: 2004-06-01
Published in Print: 2004-06-01
Copyright 2004, Walter de Gruyter
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Vladimir Yakovlevich Kozlov (to the ninetieth anniversary)
- Hopf algebras of linear recurring sequences
- Necessary conditions for solvability of a system of linear equations over a ring
- Loop codes
- On the complexity of realisation of Zhegalkin polynomials
- On new classes of conjugate injectors of finite groups
- On automorphisms of strongly regular graphs with parameters λ = 1, μ = 2
- On large deviations for the Shepp statistic
Articles in the same Issue
- Vladimir Yakovlevich Kozlov (to the ninetieth anniversary)
- Hopf algebras of linear recurring sequences
- Necessary conditions for solvability of a system of linear equations over a ring
- Loop codes
- On the complexity of realisation of Zhegalkin polynomials
- On new classes of conjugate injectors of finite groups
- On automorphisms of strongly regular graphs with parameters λ = 1, μ = 2
- On large deviations for the Shepp statistic
