Complexity of activity tests for partial Boolean functions

MaRDI QIDQ1820131zbMATH OpenFDO

Authors V. A. Vardanyan

Publication date 1986

Published in Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

activity testpartial Boolean functions

Mathematics Subject Classification ID

Review text

The concept of an activity test for partial Boolean functions is introduced. Asymptotic estimates of the complexity of minimal activity tests are obtained. It is shown that the complexity of minimal complete activity tests does not exceed the number of variables in a partial Boolean function.

Recommendations

• scientific article; zbMATH DE number 3878850
• Complexity of single dynamic tests for monotone Boolean functions
• On the complexity of restrictions of Boolean functions
• scientific article; zbMATH DE number 4187721
• On estimates on the complexity of restrictions of Boolean functions

Cited in

(2)

• Complexity of single dynamic tests for monotone Boolean functions
• The complexity of dynamic tests for functions of k-valued logic

This page was built for publication: Complexity of activity tests for partial Boolean functions

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