One Approach to synthesizing predicate circuits on the basis of generalized variables |
| |
Authors: | M S Shupletsov |
| |
Institution: | 1.Faculty of Computational Mathematics and Cybernetics,Moscow State University,Moscow,Russia |
| |
Abstract: | The asymptotic behavior of the Shannon’s function L
B(n) is studied for complexity of n-variable predicate implementation with the use of predicate circuits over arbitrary complete basis B. A new definition of the reduced weight of the predicate is introduced, regarding it as a solution of a specific linear programming
problem based on a system of predicate’s generalized variables. New, more exact upper elements for L
B(n) in a number of bases are acquired by the means of special decompositions of initial predicates using universal sets of predicates
constructed for circuits consisting of bases elements with minimal reduced weight. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|