Boolean normal forms, shellability, and reliability computations

SIAM Journal on Discrete Mathematics

Volumn 13, Issue 2, 2000, Pages 212-226

  Borgs, Endre ^a   Crama, Yves ^b   Ekin, Oya ^c   Hammer, Peter L ^a   Ibaraki, Toshihide ^d   Kogan, Alexander ^a  

^a RUTGERS UNIVERSITY   (United States)

^b UNIVERSITY OF LIÈGE   (Belgium)

^c BILKENT UNIVERSITY   (Turkey)

^d KYOTO UNIVERSITY   (Japan)

Author keywords

Boolean functions; Dualization; Orthogonal DNFs; Reliability; Shellability

Indexed keywords

EID: 0004507087     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/s089548019732180x     Document Type: Article

References (26)

1. M. O. BALL AND G. L. NEMHAUSER, Matroids and a reliability analysis problem, Math. Oper. Res., 4 (1979), pp. 132-143.
2. M. O. BALL AND J. S. PROVAN, Disjoint products and efficient computation of reliability, Oper. Res., 36 (1988), pp. 703-715.
3. R. E. BARLOW AND F. PROSCHAN, Statistical Theory of Reliability and Life Testing, Holt, Rinehart and Winston, New York, 1975.
4. C. BENZAKEN, Y. CRAMA, P. DUCHET, P. L. HAMMER, AND F. MAFFRAY, More characterizations of triangulated graphs, J. Graph Theory, 14 (1990), pp. 413-422.
5. P. BERTOLAZZI AND A. SASSANO, An O(mn) algorithm for regular set-covering problems, Theoret. Comput. Sci., 54 (1987), pp. 237-247.
6. J. C BIOCH AND T. IBARAKI, Complexity of identification and dualization of positive Boolean functions, Inform. and Comput., 123 (1995), pp. 50-63.
7. A. BJÖRNER, Homology and shellability of matroids and geometric lattices, in Matroid Applications, N. White, ed., Cambridge University Press, Cambridge, UK, 1992, pp. 226-283.
8. A. BJÖRNER, Topological methods, in Handbook of Combinatorics, R. Graham, M. Grötschel, and L. Lovász, eds., Elsevier, Amsterdam, 1995, pp. 1819-1872.
9. E. BOROS, Dualization of Aligned Boolean Functions, RUTCOR Research Report RRR 9-94, Rutgers University, New Brunswick, NJ, 1994.
10. Y. CRAMA, Dualization of regular Boolean functions, Discrete Appl Math., 16 (1987), pp. 79-85.
11. G. DANARAJ AND V. KLEE, Which spheres are shellable?, in Algorithmic Aspects of Combinatorics, Ann. Discrete Math., 2 (1978), pp. 33-52.
12. T. EITER AND G. GOTTLOB, Identifying the minimal transversals of a hypergraph and related problems, SIAM J. Comput., 24 (1995), pp. 1278-1304.
13. M. FREDMAN AND L. KHACHIYAN, On the complexity of dualization of monotone disjunctive normal forms, J. Algorithms, 21 (1996), pp. 618-628.
14. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York, 1979.
15. V. GURVICH AND L. KHACHIYAN, On Generating the Irredundant Conjunctive and Disjunctive Normal Forms of Monotone Boolean Functions, Discrete Appl. Math., 96/97 (1999), pp. 363-373.
16. V. KLEE AND P. KLEINSCHMIDT, Convex polytopes and related complexes, in Handbook of Combinatorics, R. Graham. M. Grötschel, and L. Lovász, eds., Elsevier, Amsterdam, 1995, pp. 875-917.
17. M. O. LOCKS, Inverting and minimalizing path sets and cut sets, IEEE Trans. Reliability, R-27 (1978), pp. 107-109.
18. M. O. LOCKS, Recursive disjoint products: A review of three algorithms, IEEE Trans. Reliability, R-31 (1982), pp. 33-35.
19. E. MENDELSON, Theory and Problems of Boolean Algebra and Switching Circuits, Schaum's Outline Series, McGraw-Hill, New York, London, Sydney, 1970.
20. S. MUROGA, Threshold Logic and its Applications, Wiley-Interscience, New York, 1971.
21. J. S. PROVAN, Boolean decomposition schemes and the complexity of reliability computations, DIMACS Ser. Discrete Math. 5, Amer. Math. Soc., Providence, RI, 1991, pp. 213-228.
22. J. S. PROVAN AND M. O. BALL, Efficient recognition of matroid and 2-monotonic systems, in Applications of Discrete Mathematics, Proceedings in Applied Mathematics 33, R.D. Ringeisen and F.S. Roberts, eds., SIAM, Philadelphia, PA, 1988, pp. 122-134.
23. U. N. PELED AND B. SIMEONE, Polynomial time algorithms for regular set-covering and threshold synthesis, Discrete Appl. Math., 12 (1985), pp. 57-69.
24. U. N. PELED AND B. SIMEONE, An O(nm)-time algorithm for computing the dual of a regular Boolean function, Discrete Appl. Math., 49 (1994), pp. 309-323.
25. K. G. RAMAMURTHY, Coherent Structures and Simple Games, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1990.
26. D. R. SHIER AND D. E. WHITED, Algorithms for generating minimal cutsets by inversion, IEEE Trans. Reliability, R-34 (1985), pp. 314-318.