On the size of PLAs required to realize binary and multiple-valued functions

DOI10.1109/12.8731zbMath0709.94616OpenAlexW2132949063MaRDI QIDQ3495207

Jon T. Butler, Edward A. Bender

Publication date: 1989

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/ce2116bc7cda5f182376867d9197c2bf9071389f

Mathematics Subject Classification ID

Information and communication theory, circuits (94-XX)

Related Items (1)

A new lower bound on the expected size of irredundant forms for Boolean functions

This page was built for publication: On the size of PLAs required to realize binary and multiple-valued functions