✦ LIBER ✦

On the complexity of realisation of Zhegalkin polynomials

✍ Scribed by Zabaluev, R.N.

Book ID: 120137537
Publisher: Walter de Gruyter GmbH & Co. KG
Year: 2004
Tongue: English
Weight: 103 KB
Volume: 14
Category: Article
ISSN: 0924-9265
DOI: 10.1163/156939204872329

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Complexity of Computation of Partial

On Complexity of Computation of Partial Derivatives of Boolean Functions Realized by Zhegalkin Polynomials

✍ A.N. Alekseichuk 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 49 KB

On the additive complexity of specific p

On the additive complexity of specific polynomials

✍ L. Hyafil; J.P. Van de Wiele 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 400 KB

On the Deterministic Complexity of Facto

On the Deterministic Complexity of Factoring Polynomials

✍ Shuhong Gao 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 345 KB

The paper focuses on the deterministic complexity of factoring polynomials over finite fields assuming the extended Riemann hypothesis (ERH). By the works of and , the general problem reduces deterministically in polynomial time to finding a proper factor of any squarefree and completely splitting

Level structure of Zhegalkin polynomials

Level structure of Zhegalkin polynomials, properties of test sets, and an annihilator search algorithm

✍ K. N. Koryagin 📂 Article 📅 2010 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 231 KB

On the Two-Dimensional Realisability of

On the Two-Dimensional Realisability of Chain Complexes

✍ Cockcroft, W. H.; Moss, R. M. F. 📂 Article 📅 1975 🏛 Oxford University Press 🌐 English ⚖ 147 KB

On the complexity of algorithms for the

On the complexity of algorithms for the translation of polynomials

✍ A. G. Akritas; S. D. Danielopoulos 📂 Article 📅 1980 🏛 Springer Vienna 🌐 English ⚖ 444 KB