Lower bounds for the complexity of systems of vectors of $k$-valued logic

Exact values of the complexity of generating narrow vector systems of $k$-valued logic by circuits over various bases are found. It is shown that lower bounds for the complexity of generating narrow vector systems that are asymptotically greater than the bounds obtained in this work imply exponential lower bounds for the complexity of functions of $k$-valued logic when they are realized by circuits over complete bases.
This research was supported by the Russian Foundation for Basic Research, grant 96–01–01068.