An Algorithm to Dualize a Regular Switching Function

DOI10.1109/TC.1979.1675324MaRDI QIDQ4177485zbMATH OpenOpenAlexFDO

Authors Peter L. Hammer, Uri N. Peled, Moshe A. Pollatschek

Publication date 1979

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

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

zbMATH Keywords

AlgorithmMonotone Regular Switching FunctionPrime ImplicantsSynthesis Problem of Threshold Logic

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to information and communication theory (94-04)

Cited in

(7)

• Dualization of regular Boolean functions
• Polynomial-time algorithms for regular set-covering and threshold synthesis
• An O(m n) algorithm for regular set-covering problems
• An O(nm)-time algorithm for computing the dual of a regular Boolean function
• Boolean minors
• Regular (2, 2)-systems
• The threshold order of a Boolean function

This page was built for publication: An Algorithm to Dualize a Regular Switching Function

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