An Algorithm for the Automatic Approximate Minimization of Boolean Functions

DOI10.1109/TC.1968.229160MaRDI QIDQ5556453zbMATH OpenOpenAlexFDO

Authors Nicolae N. Necula

Publication date 1968

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

Full work available at URL https://doi.org/10.1109/tc.1968.229160

zbMATH Keywords

languages, automata, networks

Cited in

(1)

• Polynomial-time algorithms for generation of prime implicants

This page was built for publication: An Algorithm for the Automatic Approximate Minimization of Boolean Functions

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