On Decomposition of Sub-definite Partial Boolean Functions
From MaRDI portal
Publication:5852964
DOI10.17516/1997-1397-2016-9-1-119-122OpenAlexW2519349570MaRDI QIDQ5852964FDOQ5852964
Authors: Ivan Konstantinovich Sharankhaev 
Publication date: 18 March 2021
Published in: Journal of Siberian Federal University. Mathematics & Physics (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/jsfu466
Recommendations
- Decomposition of Boolean functions applying the apparatus of Boolean derivatives
- scientific article; zbMATH DE number 2059953
- A new approach to the decomposition of Boolean functions by the method of \(q\)-partitions. I: Separating decomposition of full and partial functions
- scientific article; zbMATH DE number 1498461
- A decomposition of Boolean functions
decompositionsuperpositionincompletely defined Boolean functionsub-definite partial Boolean function
Cites Work
Cited In (9)
- 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?)
- A new approach to the decomposition of Boolean functions. IV. Non-disjoint decomposition: the method of \(p,q\)-partitions
- On read-once multifunctions in some base
- Decomposition of a system of incompletely specified Boolean functions defined with a binary decision diagram
- Use of partial substitutions for time decomposition of Boolean functions and generalized graph schemes of algorithms
This page was built for publication: On Decomposition of Sub-definite Partial Boolean Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5852964)
