On the length of a read-many certificate in certain extended elementary bases

DOI10.3103/S0278641915020041zbMATH Open1354.94073MaRDI QIDQ893189FDOQ893189

Authors: D. V. Kaftan 

Publication date: 13 November 2015

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

Recommendations

• On the Shannon function for read-many certificate length in a family of 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
• Testing of read-once functions in extended elementary bases

zbMATH Keywords

read-many certificateread-once functionmatrix of various values

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Iterated Boolean functions in the elementary basis
• Certificates of Non-Membership for Classes of Read-Once Functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Generation of Boolean functions under the assumption of monotonicity
• On repetition-free Boolean functions over pre-elementary monotone bases
• Title not available (Why is that?)

Cited In (3)

• The length of a read-many certificate in the basis of all functions of \(l\) variables
• On the Shannon function for read-many certificate length in a family of bases
• A new proof of Stetsenko's theorem

This page was built for publication: On the length of a read-many certificate in certain extended elementary bases

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