By Topic

On the Solution of Boolean and Pseudo-Boolean Relations

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

1 Author(s)
Klir, G.J. ; School of Advanced Technology, State University of New York

This correspondence deals with collections of n binary relations between Boolean and/or pseudo-Boolean functions which are combined by an n-ary relation. A new algorithm is described for solving these relations.

Published in:

Computers, IEEE Transactions on  (Volume:C-23 ,  Issue: 10 )