Name
Abstract | ||
|---|---|---|
Optimal networks consisting of NOR-OR gates (each gate produces the NOR and/or the OR of its inputs) are tabulated for all Boolean functions of three variables. Optimality is defined as minimizing first the number of gates and then the number of interconnections. The optimal networks were synthesized for each Boolean function by using an integer programming synthesis technique. |
Year | DOI | Venue |
|---|---|---|
1972 | 10.1109/TC.1972.5008920 | IEEE Transactions on Computers |
Keywords | Field | DocType |
Logic gates,Boolean functions,Linear programming,Data mining,Probability density function,Computers | Boolean function,Boolean network,Topology,Discrete mathematics,Logic gate,Boolean circuit,TC0,Computer science,Parallel computing,Integer programming,OR gate,Linear programming | Journal |
Volume | Issue | ISSN |
21 | 2 | 0018-9340 |
Citations | PageRank | References |
7 | 0.93 | 3 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| C. R. Baugh | 1 | 255 | 68.10 |
| C. Sekar Chandersekaran | 2 | 77 | 23.38 |
| Richard S. Swee | 3 | 7 | 0.93 |
| S. Muroga | 4 | 430 | 252.48 |