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

DOI10.1109/12.8731MaRDI QIDQ3495207zbMATH OpenOpenAlexFDO

Authors Edward A. Bender, Jon T. Butler

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)

Cited in

(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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3495207)