Interior and exterior functions of Boolean functions

Discrete Applied Mathematics

Volumn 69, Issue 3, 1996, Pages 209-231

  Makino, Kazuhisa ^a   Ibaraki, Toshihide ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001726545     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(95)00092-6     Document Type: Article

References (11)

1. M.O. Ball and J.S. Provan, Disjoint products and efficient computation of reliability, Oper. Res. 36 (1988) 703-715.
2. C. Berge, Hypergraphs, North-Holland Mathematical Library, Vol.45 (1989).
3. P. Bertolazzi and A. Sassano, An O(mn) time algorithm for regular set-covering problems, Theoret. Comput. Sci. 54 (1987) 237-247.
4. J.C. Bioch and T. Ibaraki, Complexity of identification and dualization of positive Boolean functions, Inform, and Comput. 123 (1995) 50-63.
5. E. Boros, P.L. Hammer, T. Ibaraki and K. Kawakami, Identifying 2-monotonic positive Boolean functions in polynomial time, in: W.L. Hsu and R.C.T. Lee, eds., ISA'91 Algorithms, Lecture Notes in Computer Science 557 (Springer, Berlin, 1991) 104-115; full version: SIAM J. Comput., to appear.
6. E. Boros, P.L. Hammer, T. Ibaraki and K. Kawakami, Identifying 2-monotonic positive Boolean functions in polynomial time, in: W.L. Hsu and R.C.T. Lee, eds., ISA'91 Algorithms, Lecture Notes in Computer Science 557 (Springer, Berlin, 1991) 104-115; full version: SIAM J. Comput., to appear.
7. C.J. Colbourn, The Combinatorics of Network Reliability (Oxford University Press, Oxford, 1987).
8. Y. Crama, Dualization of regular Boolean functions, Discrete Appl. Math., 16 (1987) 79-85.
9. Y. Crama, P.L. Hammer and T. Ibaraki, Cause-effect relationships and partially defined boolean functions, Ann. Oper. Res. 16 (1988) 299-326.
10. T. Eiter and G. Gottlob, Identifying the minimal transversals of a hypergraph and related problems, Technical Report CD-TR 91/16, Christial Doppler Labor für Expertensysteme, Technische Universität Wien, (1991); SIAM J Comput., to appear.
11. T. Eiter and G. Gottlob, Identifying the minimal transversals of a hypergraph and related problems, Technical Report CD-TR 91/16, Christial Doppler Labor für Expertensysteme, Technische Universität Wien, (1991); SIAM J Comput., to appear.