Multiple Parallel Computations of Terms of Generalized Polynomial Forms of Representations of Boolean Functions

摘要

Methods for vector and multiple logical computations are described. An algorithm is presented that allows for parallel computations of the values of the conjunctive terms of generalized polynomial forms using multiple sets of variables. Evaluations of the performance of the proposed algorithm are given. An example of multiple parallel computations of the terms of an arithmetic polynomial is analyzed.