On connected Boolean functions
From MaRDI portal
Publication:1961460
DOI10.1016/S0166-218X(99)00098-0zbMath0937.06014MaRDI QIDQ1961460
Oya Ekin, Peter L. Hammer, Alexander Kogan
Publication date: 14 February 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
monotone; computational complexity; Boolean function; geodetic; unate; DNF representation; subgraph of the Boolean hypercube
Related Items
On the Boolean connectivity problem for Horn relations, Logical analysis of numerical data, Convexity and logical analysis of data, Logical analysis of data -- the vision of Peter L. Hammer, The connectivity of Boolean satisfiability: dichotomies for formulas and circuits, Integrated optimization model and algorithm for pattern generation and selection in logical analysis of data, On the Structure of Solution-Graphs for Boolean Formulas
Cites Work