On algorithms for construction of all irreducible partial covers
References (8)
- et al.
Almost all monotone Boolean functions are polynomially lernable using membership queries
Information Processing Letters
(2001) - et al.
Polynomial time recognition of 2-monotonic positive Boolean functions given by an oracle
SIAM Journal on Computing
(1997) - et al.
Logical methods of electric circuit control
Trudy MIAN SSSR
(1958) On the number of monotone Boolean functions
Problemy Kibernetiki
(1981)
There are more references available in the full text version of this article.
Cited by (2)
Lazy classification algorithms based on deterministic and inhibitory dicision rules
2009, Studies in Computational IntelligenceUniversal attribute reduction problem
2008, Studies in Computational Intelligence
Copyright © 2007 Elsevier B.V. All rights reserved.