Decomposability of partially defined Boolean functions
DOI10.1016/0166-218X(94)00145-4zbMATH Open0833.68090DBLPjournals/dam/BorosGHIK95WikidataQ59560933 ScholiaQ59560933MaRDI QIDQ1900137FDOQ1900137
Authors: Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Alex Kogan, Vladimir Gurvich 
Publication date: 11 March 1996
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Hypergraphs (05C65) Boolean functions (06E30)
Cites Work
- Title not available (Why is that?)
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Structure identification in relational data
- Decompositions of positive self-dual Boolean functions
- Title not available (Why is that?)
- Decomposing a relation into a tree of binary relations
- Complex Disjunctive Decomposition of Incompletely Specified Boolean Functions
- Compositional complexity of Boolean functions
- Synthesis of Combinational Logic Using Decomposition and Probability
Cited In (23)
- Title not available (Why is that?)
- Separable discrete functions: recognition and sufficient conditions
- Bidual Horn functions and extensions
- Title not available (Why is that?)
- Title not available (Why is that?)
- A decomposition of Boolean functions
- Logical analysis of data -- the vision of Peter L. Hammer
- Mining determining sets for partially defined functions using entropy
- Title not available (Why is that?)
- On a convex geometric connection to threshold logic
- Title not available (Why is that?)
- Logical analysis of data: classification with justification
- Properties of quasi-Boolean function on quasi-Boolean algebra
- Title not available (Why is that?)
- Logical analysis of numerical data
- Logical analysis of binary data with missing bits
- The complexity of modular decomposition of Boolean functions
- Decomposition of a system of incompletely specified Boolean functions defined with a binary decision diagram
- Inner-core and outer-core functions of partially defined Boolean functions
- Pareto-optimal patterns in logical analysis of data
- Error-free and best-fit extensions of partially defined Boolean functions
- Logical analysis of data with decomposable structures.
- A decomposability index in logical analysis of data
This page was built for publication: Decomposability of partially defined Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1900137)
