Cart (Loading....) | Create Account
Close category search window
 

The complexity of the inclusion operation on OFDD's

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)
Drechsler, R. ; Inst. of Comput. Sci., Albert-Ludwigs-Univ., Freiburg, Germany ; Sauerhoff, M. ; Sieling, D.

Ordered functional decision diagrams (OFDD's) are a data structure for representation and manipulation of Boolean functions. A polynomial time algorithm for the test whether f⩽g for functions f and g given by OFDD's is presented. This is the last basic operation on OFDD's whose complexity was unknown. The result also solves an open question on the complexity of minimizing OFDD's for incompletely specified functions

Published in:

Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on  (Volume:17 ,  Issue: 5 )

Date of Publication:

May 1998

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.