On the complexity of generalized polynomials of <Emphasis Type="Italic">k</Emphasis>-valued functions |
| |
| Authors: | S N Selezneva A B Dainyak |
| |
| Institution: | (1) Department of Mathematical Cybernetics, Faculty of Computational Mathematics and Cybernetics, Moscow State University, Moscow, 119991, Russia |
| |
| Abstract: | Specification of k-valued functions with generalized polynomials (for simple k) is considered. A generalized polynomial is a mod k polynomial in which each variable may also occur with one or several Post negations. The upper and lower estimates of the complexity of generalized polynomials are found for k-valued functions. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
