On the complexity of realisation of Zhegalkin polynomials

DOI10.1515/156939204872329zbMath1122.06013OpenAlexW2032670824MaRDI QIDQ4825172

R. N. Zabaluev

Publication date: 27 October 2004

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/156939204872329

zbMATH Keywords

complexity of Boolean functions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Boolean functions (06E30)

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: On the complexity of realisation of Zhegalkin polynomials