The complexity of dynamic tests for functions of k-valued logic

DOI10.1007/BF01132082MaRDI QIDQ4204114zbMATH OpenOpenAlexFDO

Authors V. A. Vardanyan

Publication date 1988

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01132082

zbMATH Keywords

complexity boundsfunctions of k-valued logics-dynamic tests for Boolean functions

Mathematics Subject Classification ID

Recommendations

• scientific article; zbMATH DE number 709443
• scientific article; zbMATH DE number 3878850
• scientific article; zbMATH DE number 3885799
• Complexity of single dynamic tests for monotone Boolean functions
• scientific article; zbMATH DE number 3943711

Cites work

• Complexity of activity tests for partial Boolean functions
• Complexity of single dynamic tests for monotone Boolean functions
• Dynamic Testing of Redundant Logic Networks
• scientific article; zbMATH DE number 3943711 (Why is no real title available?)
• scientific article; zbMATH DE number 3273888 (Why is no real title available?)

Cited in

(5)

• scientific article; zbMATH DE number 3878850 (Why is no real title available?)
• scientific article; zbMATH DE number 3916177 (Why is no real title available?)
• Complexity of single dynamic tests for monotone Boolean functions
• scientific article; zbMATH DE number 709443 (Why is no real title available?)
• An improved test of Boolean functions for \(k\)-dimensionality

This page was built for publication: The complexity of dynamic tests for functions of k-valued logic

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