Polynomial transformation of Boolean functions: analysis of computational algorithms

DOI10.1134/S0005117914070108zbMATH Open1325.94172OpenAlexW2093859871MaRDI QIDQ893933FDOQ893933

Authors: A. A. Akinin, A. V. Achkasov, S. V. Tyurin, S. L. Podvalny 

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

• Numerical computation of characteristic polynomials of Boolean functions and its applications
• Algorithms for synthesis of polynomials implementing weakly specified Boolean functions and systems
• Properties of polynomials of periodic functions and the complexity of periodicity detection by the Boolean function polynomial

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q893933)