Lean-verified proofs for [40]

Sergeev I. S. On the multiplicative complexity of polynomials. Discrete Mathematics and Applications. 2024. 34(1), 29-32.

Upper bounds (Theorems 1 and 2). LEAN

Lower bounds for odd d (Theorems 1 and 2). LEAN

Lean-verified proofs were derived by an AI-assistant from text proofs in Reaslab environment.