On connected Boolean functions

Discrete Applied Mathematics

Volumn 96-97, Issue , 1999, Pages 337-362

  Ekin, Oya ^a   Hammer, Peter L ^b   Kogan, Alexander ^b,c  

^a BILKENT UNIVERSITY   (Turkey)

^b RUTGERS UNIVERSITY   (United States)

^c RUTGERS UNIVERSITY   (United States)

Author keywords

Boolean convexity; Boolean function; Computational complexity; Connectedness; Disjunctive normal form; Geodetic; Monotone; Recognition; Unate

Indexed keywords

EID: 0041596787     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00098-0     Document Type: Article

References (7)

1. A. Blake, Canonical expressions in Boolean algebra, Ph.D. Thesis, University of Chicago, August 1937.
2. E. Boros, Y. Crama, P.L. Hammer, Polynomial-time inference of all valid implications for Horn and related formulae, Ann. Math. Artif. Intell. 1 (1990) 21-32.
3. E. Boros, P.L. Hammer, X. Sun, Recognition of q-Horn formulae in linear time, Discrete Appl. Math. 55 (1994) 1-13.
4. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, San Francisco, 1979.
5. P.L. Hammer, A. Kogan, Quasi-acyclic prepositional Horn knowledge bases: optimal compression, IEEE Trans. Knowledge Data Eng. 7 (5) (1995) 751-762.
6. T. Hegedüs, N. Megiddo, On the geometric separability of Boolean functions, Discrete Appl. Math. 66 (1996) 205-218.
7. W. Quine, A way to simplify truth functions, Amer. Math. Monthly 62 (1955) 627-631.