A Method of Producing a Boolean Function Having an Arbitrarily Prescribed Prime Implicant Table
From MaRDI portal
Publication:5529193
DOI10.1109/PGEC.1965.264175zbMath0149.41404OpenAlexW1972326543MaRDI QIDQ5529193
Publication date: 1965
Published in: IEEE Transactions on Electronic Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/pgec.1965.264175
Related Items
Inference of a minimum size Boolean function from examples by using a new efficient branch-and-bound approach ⋮ Fault diameter of interconnection networks ⋮ Regular separable graphs of minimum order with given diameter ⋮ High density graphs for processor interconnection ⋮ The covering radius of doubled 2-designs in \(2O_ k\) ⋮ Graphs on alphabets as models for large interconnection networks ⋮ The covering radius of Hadamard codes in odd graphs ⋮ One method for proving the impossibility of certain Moore graphs
