Subject
Computational Mathematics
Reference18 articles.
1. T. Sasao and P. Besslich, “On the complexity of mod-2 sum PLA’s,” IEEE Trans. Comput. 39 (2), 262–266 (1990).
2. V. P. Suprun, “Complexity of Boolean functions in the class of canonical polarized polynomials,” Discrete Math. Appl. 4 (3), 273–277 (1994).
3. N. A. Peryazev, “Complexity of Boolean functions in the class of polarized polynomial forms,” Algebra Logic 34 (3), 177–179 (1995).
4. K. D. Kirichenko, “An upper bound for complexity of polynomial normal forms of Boolean functions,” Discrete Math. Appl. 15 (4), 351–360 (2005).
5. R. Ishikawa, T. Hirayama, G. Koda, and K. Shimizu, “New three-level Boolean expression based on EXOR gates,” IEICE Trans. Inf. Syst. E87-D 5, 1214–1222 (2004).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献