Factoring logic functions using graph partitioning

Martin C. Golumbic, Aviad Mintz

Research output: Contribution to journalConference articlepeer-review


Presented in this paper is the result of the investigation of algorithmic method use for factoring that uses graph partitioning rather that division. The method is a generalization of techniques for the so called read once functions which uses a special classes of Boolena functions, to devise new combinatorial algorithms for logic minimization. This method has been implemented in the SIS environment, and an empirical evaluation indicates that usually better results are produce rather than algebraic factoring and this method is quite competitive with Boolean factoring but with lower computation costs.

Original languageEnglish
Pages (from-to)195-198
Number of pages4
JournalIEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers
StatePublished - 1999
Externally publishedYes
EventProceedings of the 1999 IEEE/ACM International Conference on Computer-Aided Design (ICCAD-99) - San Jose, CA, USA
Duration: 7 Nov 199911 Nov 1999

ASJC Scopus subject areas

  • Software
  • Computer Science Applications
  • Computer Graphics and Computer-Aided Design


Dive into the research topics of 'Factoring logic functions using graph partitioning'. Together they form a unique fingerprint.

Cite this