An Algorithm to Dualize a Regular Switching Function

DOI10.1109/TC.1979.1675324zbMath0394.94036OpenAlexW1799057383MaRDI QIDQ4177485

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

AlgorithmPrime ImplicantsMonotone Regular Switching FunctionSynthesis Problem of Threshold Logic

Mathematics Subject Classification ID

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

Related Items

An \(O(nm)\)-time algorithm for computing the dual of a regular Boolean function, 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, Boolean minors, Regular (2, 2)-systems, The threshold order of a Boolean function