By Topic

Computational Complexity of Partitioned List Algorithms

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
$33 $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)

Some parameters related to the computational complexity of partitioned list algorithms are evaluated. Specifically, an upper bound is computed for the average number of comparisons needed by the most unsophisticated version of a partitioned list algorithm for processing a Boolean function in v variables and u canonical clauses. For the same functions the average memory size required for processing is also computed. Furthermore the minimum memory size necessary for processing any Boolean function in u canonical clauses by either a partitioned or a nonpartitioned list algorithm is computed. Results obtained from the above comparisons demonstrate that partitioned list algorithms compare favorably with nonpartitioned ones both with regard to the time and the memory required for computation.

Published in:

IEEE Transactions on Computers  (Volume:C-19 ,  Issue: 5 )