Subject
Computational Mathematics,Control and Optimization,Human-Computer Interaction
Reference7 articles.
1. S. V. Yablonskii, Introduction to Discrete Mathematics (Nauka, Moscow, 1986) [in Russian].
2. N. A. Peryazev, “Complexity of Boolean Functions in a Class of Polynomial Polarized Forms,” Algebra Logika 34, 323–326 (1995).
3. C. H. Selezneva, “On the Complexity of Representation of Functions of Multiple-Valued Logics with Polarized Polynomials,” Diskret. Mat. 14(2), 48–53 (2002).
4. V. B. Alekseev, A. A. Voronenko, and S. N. Selezneva, “On the Complexity of Realization of Functions of a k-Valued Logic with Polarized Polynomials,” in Poc. 5th Int. Conf. “Discrete Models in Theory of Control Systems”, Ratmino, Moscow Obl., 2003 (MAKS, Moscow, 2003), pp. 8–9 [in Russian].
5. S. N. Selezneva, “On the Complexity of Polarized Polynomials of Multiple-Valued Logics Depending on one Variable,” Diskret Mat. 16(2), 117–120 (2004).
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献