Decomposability of partially defined Boolean functions
- 1 September 1995
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 62 (1-3), 51-75
- https://doi.org/10.1016/0166-218x(94)00145-4
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Decompositions of positive self-dual boolean functionsDiscrete Mathematics, 1995
- A theory of coteries: mutual exclusion in distributed systemsIEEE Transactions on Parallel and Distributed Systems, 1993
- Structure identification in relational dataArtificial Intelligence, 1992
- Decomposing a relation into a tree of binary relationsJournal of Computer and System Sciences, 1990
- Cause-effect relationships and partially defined Boolean functionsAnnals of Operations Research, 1988
- Induction of decision treesMachine Learning, 1986
- Compositional complexity of Boolean functionsDiscrete Applied Mathematics, 1982
- Synthesis of Combinational Logic Using Decomposition and ProbabilityIEEE Transactions on Computers, 1980
- A linear-time algorithm for testing the truth of certain quantified boolean formulasInformation Processing Letters, 1979
- Complex Disjunctive Decomposition of Incompletely Specified Boolean FunctionsIEEE Transactions on Computers, 1973