On connected Boolean functions

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)

zbMATH Keywords

monotonecomputational complexityBoolean functiongeodeticunateDNF representationsubgraph of the Boolean hypercube

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Boolean functions (06E30) Connectivity (05C40)

Related Items (7)

Logical analysis of data -- the vision of Peter L. Hammer ⋮ Logical analysis of numerical data ⋮ Integrated optimization model and algorithm for pattern generation and selection in logical analysis of data ⋮ On the Boolean connectivity problem for Horn relations ⋮ The connectivity of Boolean satisfiability: dichotomies for formulas and circuits ⋮ On the Structure of Solution-Graphs for Boolean Formulas ⋮ Convexity and logical analysis of data

Cites Work

• Unnamed Item
• Unnamed Item
• Recognition of \(q\)-Horn formulae in linear time
• Polynomial-time inference of all valid implications for Horn and related formulae
• On the geometric separability of Boolean functions
• A Way to Simplify Truth Functions

This page was built for publication: On connected Boolean functions