scientific article; zbMATH DE number 5531167

MaRDI QIDQ3617448zbMATH OpenFDO

Authors A. A. Voronenko

Publication date 24 March 2009

Mathematics Subject Classification ID

Nonparametric hypothesis testing (62G10) Fault detection; testing in circuits and networks (94C12)

Cited in

(11)

• Testing disjunction as a read-once function in an arbitrary unrepeated basis
• Read-once functions with hard-to-test projections
• Testing read-once functions over the elementary basis
• Iterated Boolean functions in the elementary basis
• Testing of read-once functions in extended elementary bases
• Testing read-once functions in a median-augmented element basis
• Using relevance queries for identification of read-once functions
• scientific article; zbMATH DE number 7310075 (Why is no real title available?)
• Some test length bounds for nonrepeating functions in the \(\{ \& , \vee \}\) basis
• Learning read once functions using subcube parity queries
• Recognizing the nonrepeating property in an arbitrary basis

This page was built for publication:

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