Abstract
The Shannon complexity of finding a maximal zero for some classes of monotone Boolean functions in Post's classification is estimated.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
https://doi.org/10.1016/0041-5553(88)90011-0
Publication Date: Jan 1, 1988 | |
Citations: 1 |
The Shannon complexity of finding a maximal zero for some classes of monotone Boolean functions in Post's classification is estimated.
Join us for a 30 min session where you can share your feedback and ask us any queries you have