On the Complexity of Multivalued Logic Functions over Some Infinite Basis
Sign Up to like & getrecommendations! Published in 2018 at "Journal of Applied and Industrial Mathematics"
DOI: 10.1134/s1990478918010052
Abstract: Under study is the complexity of the realization of k-valued logic functions (k ≥ 3) by logic circuits in the infinite basis consisting of the Post negation (i.e., the function (x + 1) mod k)… read more here.
Keywords: complexity; logic functions; infinite basis; function ... See more keywords