A new proof of Stetsenko's theorem

DOI10.3103/S0278641914020095zbMATH Open1316.94140OpenAlexW2009434078MaRDI QIDQ2018643FDOQ2018643

A. A. Voronenko

Publication date: 25 March 2015

Published in: Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s0278641914020095

zbMATH Keywords

treeread-once functionsuppressing (nonsuppressing) constant

Mathematics Subject Classification ID

Boolean functions (06E30)

Cites Work

• Iterated Boolean functions in the elementary basis
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: A new proof of Stetsenko's theorem

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