A new proof of Stetsenko's theorem

DOI10.3103/S0278641914020095MaRDI QIDQ2018643zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Iterated Boolean functions in the elementary basis
• scientific article; zbMATH DE number 176867
• Functions that are read-once on a subset of their inputs
• Combinatorial characterization of read-once formulae
• On the length of a read-many certificate in certain extended elementary bases

Cites work

• scientific article; zbMATH DE number 609986 (Why is no real title available?)
• scientific article; zbMATH DE number 3248024 (Why is no real title available?)
• Iterated Boolean functions in the elementary basis

Cited in

(1)

• Iterated Boolean functions in the elementary basis

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)