Factoring Boolean functions using graph partitioning

DOI10.1016/j.dam.2005.02.007zbMath1101.94033OpenAlexW1979604948MaRDI QIDQ2387436

Martin Charles Golumbic, Aviad Mintz

Publication date: 2 September 2005

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

Full work available at URL: https://doi.org/10.1016/j.dam.2005.02.007

zbMATH Keywords

Graph partitioningLogic synthesisFactoring Boolean functions

Mathematics Subject Classification ID

Related Items (9)

On lengths of edge-labeled graph expressions ⋮ Complexity minimization in rule-based category learning: revising the catalog of Boolean concepts and evidence for non-minimal rules ⋮ Estimation of expressions' complexities for two-terminal directed acyclic graphs ⋮ Partially unate Boolean functions: properties of their sum-of-products representations ⋮ An improvement on the complexity of factoring read-once Boolean functions ⋮ Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial \(k\)-trees ⋮ A compositional approach to probabilistic knowledge compilation ⋮ Read-Once Functions Revisited and the Readability Number of a Boolean Function ⋮ Decomposition methods for generating algebraic expressions of full square rhomboids and other graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factoring logic functions
• On the Complexity of Dualization of Monotone Disjunctive Normal Forms
• An Efficient Heuristic Procedure for Partitioning Graphs
• The Fanout Structure of Switching Functions
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• Topics in Intersection Graph Theory

This page was built for publication: Factoring Boolean functions using graph partitioning