Abstract :
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.
Keywords :
Boolean functions, computational complexity, computing time, maximum number of k cubes, memory area, minimization, partitioned list, prime implicants, Quine-McCluskey algorithm.; Approximation algorithms; Boolean functions; Computational complexity; Minimization methods; Partitioning algorithms; Upper bound; Boolean functions, computational complexity, computing time, maximum number of k cubes, memory area, minimization, partitioned list, prime implicants, Quine-McCluskey algorithm.;
