Partially unate Boolean functions: properties of their sum-of-products representations

DOI10.1016/j.dam.2023.05.028MaRDI QIDQ6110617

Maurizio Damiani

Publication date: 2 August 2023

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

Boolean algebradisjunctive normal formswitching theorytwo-level synthesis

Mathematics Subject Classification ID

Boolean functions (06E30) Boolean functions (94D10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factoring Boolean functions using graph partitioning
• Minimizing Disjunctive Normal Form Formulas and $AC^0$ Circuits Given a Truth Table
• Graph-Based Algorithms for Boolean Function Manipulation
• On Dedekind's Problem: The Number of Isotone Boolean Functions. II
• The Fanout Structure of Switching Functions
• MINI: A Heuristic Approach for Logic Minimization
• Recursive Operators for Prime Implicant and Irredundant Normal Form Determination
• The Problem of Simplifying Truth Functions

This page was built for publication: Partially unate Boolean functions: properties of their sum-of-products representations