An Algorithm for Testing 2-Asummability of Boolean Functions

Authors:
A. K. Sarje;N. N. Biswas
Affiliations:
School of Automation, Indian Institute of Science;-
Venue:
IEEE Transactions on Computers
Year:
1977

Citing 4
Cited 1

Introduction to Logic and Switching Theory

Introduction to Logic and Switching Theory
An Algorithm for Testing Asummability of Boolean Functions

IEEE Transactions on Computers
A Slide Rule Device for Checking 2-Summability

IEEE Transactions on Computers
Simple Methods for the Testing of 2-Summability of Boolean Functions and Isobaricity of Threshold Functions

IEEE Transactions on Computers

An efficient heuristic to identify threshold logic functions

ACM Journal on Emerging Technologies in Computing Systems (JETC)

Quantified Score

Hi-index	14.98

Visualization

Abstract

Simple algorithms have been developed to generate pairs of minterms forming a given 2-sum and thereby to test 2-asummability of switching functions. The 2-asummability testing procedure can be easily implemented on the computer. Since 2-asummability is a necessary and sufficient condition for a switching function of upto eight variables to be linearly separable (LS), it can be used for testing LS switching functions of upto eight variables.