Some test length bounds for nonrepeating functions in the \ \& , \ basis

DOI10.1007/S10598-010-9064-8MaRDI QIDQ616569zbMATH OpenOpenAlexFDO

Authors S. E. Bubnov, A. A. Voronenko, Dmitry Chistikov

Publication date 10 January 2011

Published in Computational Mathematics and Modeling (Search for Journal in Brave)

Full work available at URL http://www.springerlink.com/content/8n45q38k70545pn4/

zbMATH Keywords

diagnostic testmonotonicitynonrepeating functionnormal formShannon functiontest length bound

Mathematics Subject Classification ID

Recommendations

• On testing repetition-free functions
• Testing read-once functions over the elementary basis
• Testing of read-once functions in extended elementary bases
• Recognizing the nonrepeating property in an arbitrary basis
• Lower estimate of the length of the complete test in the basis \(\{x|y \}\)

Cites work

• scientific article; zbMATH DE number 5531167 (Why is no real title available?)
• scientific article; zbMATH DE number 3510201 (Why is no real title available?)
• scientific article; zbMATH DE number 3545568 (Why is no real title available?)
• Learning read-once functions individually

Cited in

(3)

• Testing read-once functions over the elementary basis
• On testing repetition-free functions
• Recognizing the nonrepeating property in an arbitrary basis

This page was built for publication: Some test length bounds for nonrepeating functions in the \(\{ \& , \vee \}\) basis

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