On the Shannon function for read-many certificate length in a family of bases

DOI10.3103/S0278641913040092MaRDI QIDQ264013zbMATH OpenOpenAlexFDO

Authors A. A. Voronenko

Publication date 5 April 2016

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

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

zbMATH Keywords

discriminatornonconstant row matrixread-once function

Mathematics Subject Classification ID

Measures of information, entropy (94A17)

Recommendations

• On the length of a read-many certificate in certain extended elementary bases
• The length of a read-many certificate in the basis of all functions of l variables
• Certificates of Non-Membership for Classes of Read-Once Functions
• Testing read-once functions over the elementary basis
• On testing repetition-free functions

Cites work

• Certificates of Non-Membership for Classes of Read-Once Functions
• Iterated Boolean functions in the elementary basis

Cited in

(2)

• The length of a read-many certificate in the basis of all functions of l variables
• On the length of a read-many certificate in certain extended elementary bases

This page was built for publication: On the Shannon function for read-many certificate length in a family of bases

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