Affiliation:
1. The University of Western Ontario, London, Canada
Abstract
There are, essentially, just 17 subsets of the 16 binary logical operations which are both (a) complete in the sense that any n-variable logical function can be expressed with them and (b) minimal, subject to (a). For each of these bases, it is shown how to construct, for any logical function F, a planar logical circuit with gates from that base alone which realizes F. This is done by constructing a planar crossover circuit for each minimal base. Minimality of the crossover circuits is discussed.
Publisher
Association for Computing Machinery (ACM)
Reference4 articles.
1. The monotone and planar circuit value problems are log space complete for P
2. Harary F. Graph Theory Addison-Wesley Reading Mass. 1971. Harary F. Graph Theory Addison-Wesley Reading Mass. 1971.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献