Polynomial transformation of Boolean functions: analysis of computational algorithms

DOI10.1134/S0005117914070108zbMath1325.94172OpenAlexW2093859871MaRDI QIDQ893933

A. A. Akinin, S. V. Tyurin, A. V. Achkasov, S. L. Podval'nyi

Publication date: 23 November 2015

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0005117914070108

zbMATH Keywords

computational complexity\(n\)-argument Boolean functionsnecessary hardware resourcespolynomial factoring algorithms

Mathematics Subject Classification ID

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Polynomial transformation of Boolean functions: analysis of computational algorithms