Complexity of activity tests for partial Boolean functions (Q1820131)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3993453
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of activity tests for partial Boolean functions |
scientific article; zbMATH DE number 3993453 |
Statements
Complexity of activity tests for partial Boolean functions (English)
0 references
1986
0 references
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.
0 references
activity test
0 references
partial Boolean functions
0 references
0.7931022644042969
0 references
0.7803393006324768
0 references
0.7782279253005981
0 references
