By Topic

Factoring and recognition of read-once functions using cographs and normality

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Golumbic, M.C. ; Dept. of Math. & Comput. Sci., Bar-Ilan Univ., Ramat-Gan, Israel ; Mintz, A. ; Rotics, U.

An approach for factoring general Boolean functions was described [Golumbic, M et al., 1999] which is based on graph partitioning algorithms. In this paper, we present a very fast algorithm for recognizing and factoring read-once functions which is needed as a dedicated factoring subroutine to handle the lower levels of that factoring process. The algorithm is based on algorithms for cograph recognition and on checking normality. Our method has been implemented in the SIS environment, and an empirical evaluation is given.

Published in:

Design Automation Conference, 2001. Proceedings

Date of Conference: