Author:
Baliuk A. S.,Zinchenko A. S.
Reference12 articles.
1. Gegalkine J. J., “L’arithmétisation de la logique symbolique,” Mat. Sb., vol. 35, No. 3–4, 311–377 (1928).
2. Muller D. E., “Application of Boolean algebra to switching circuit design and to error detection,” IRE Trans. Electron. Comput., vol. EC–3, no. 3, 6–12 (1954).
3. Mukhopadhyay A. and Schmitz G., “Minimization of exclusive or and logical equivalence switching circuits,” IEEE Trans. Comput., vol. C–19, no. 2, 132–140 (1970).
4. Pradhan D. K. and Patel A. M., “Reed–Muller like canonic forms for multivalued functions,” IEEE Trans. Comput., vol. C–24, no. 2, 206–210 (1975).
5. Peryazev N. A., “Complexity of Boolean functions in the class of polarized polynomial forms,” Algebra and Logic, vol. 34, No. 3, 177–179 (1995).
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献