On connected Boolean functions
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3029852 (Why is no real title available?)
- A Way to Simplify Truth Functions
- On the geometric separability of Boolean functions
- Polynomial-time inference of all valid implications for Horn and related formulae
- Recognition of \(q\)-Horn formulae in linear time
Cited in
(14)- scientific article; zbMATH DE number 822063 (Why is no real title available?)
- One-to-one correspondense between proper families of Boolean functions and unique sink orientations of cubes
- On the Boolean connectivity problem for Horn relations
- On the structure of solution-graphs for Boolean formulas
- Connected Boolean functions with a locally extremal number of prime implicants
- Expanding \(\text{FL}_{ew}\) with a Boolean connective
- Join-irreducible Boolean functions
- On a class of Boolean functions with matroid property
- On computing Boolean connectives of characteristic functions
- Logical analysis of numerical data
- Integrated optimization model and algorithm for pattern generation and selection in logical analysis of 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
This page was built for publication: On connected Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1961460)