A new approach to the decomposition of Boolean functions by the method of \(q\)-partitions. II. Repeated decomposition

DOI10.1023/A:1015587930961zbMath1023.06012OpenAlexW313399992MaRDI QIDQ1407342

B. E. Rytsar

Publication date: 16 September 2003

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1015587930961

zbMATH Keywords

Boolean functionsdecomposition of Boolean functionsdecomposition clonesfull and partial functionsmethod of \(q\)-partitionstabular representation of \(q\)-partitionsmaximal clones of repeated decompositionrepeated decomposition

Mathematics Subject Classification ID

Boolean functions (06E30)

Related Items (2)

A new approach to the decomposition of Boolean functions by the method of \(q\)-partitions. III: Joint decomposition of a function system ⋮ A new approach to the decomposition of Boolean functions. IV. Non-disjoint decomposition: the method of \(p,q\)-partitions

This page was built for publication: A new approach to the decomposition of Boolean functions by the method of \(q\)-partitions. II. Repeated decomposition