ON MINIMAL MODULO 2 SUMS OF PRODUCTS FOR SWITCHING FUNCTIONS.

Abstract

The minimal number of terms required for representing any switching function as a modulo-2 sums of products is investigated, and algorithm for obtaining economical ralizations is described. The main result is the following: Every symmetric function of 2m+1 variables has a modulo-2 sum of products realization with at most 3 to the mth power terms, but there are functions of n variables which require at least 2 to the nth power/n log to the base 2 of 3 terms, for sufficiently large n. (Author)

Document Details

Document Type
Technical Report
Publication Date
Mar 15, 1966
Accession Number
AD0653311

Entities

People

  • Azaria Paz
  • Igal Kohavi
  • Shimon Even

Organizations

  • Technion – Israel Institute of Technology

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Switching

Fields of Study

  • Mathematics

Readers

  • Approximation Theory.