๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An Algorithm for Testing Asummability of Boolean Functions

โœ Scribed by Sureshchander


Book ID
114588125
Publisher
IEEE
Year
1974
Tongue
English
Weight
684 KB
Volume
C-23
Category
Article
ISSN
0018-9340

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


The fixing groups for the 2-asummable Bo
โœ Takao Ueda ๐Ÿ“‚ Article ๐Ÿ“… 1977 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 749 KB

The prmcipal result in thus paper ia as fc~llows. 1x1 f be a positive 2-asummahlc &;ulr~n function of n variables X,, . . ., X,. Then N ~2 {I,. . ., n] is partitioned into sets N,, \_ . . Nk such that the group of permutations of N that leave j invariant IS the direct pwduct of the symmetric groups

An Algorithm for Solving Boolean Equatio
โœ Svoboda, Antonin ๐Ÿ“‚ Article ๐Ÿ“… 1963 ๐Ÿ› Institute of Electrical and Electronics Engineers ๐ŸŒ English โš– 638 KB