On Some Classes of Functions and Hypercubes

2008/12/23 by Kovachev, Dimiter Stoichkov
#Computational Complexity (cs.CC) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #G.2.0

paper · doi:10.48550/arxiv.0812.4367

Abstract

In this paper, some classes of discrete functions of k-valued logic are considered, that depend on sets of their variables in a particular way. Obtained results allow to "construct" these functions and to present them in their tabular, analytical or matrix form, that is, as hypercubes, and in particular Latin hypercubes. Results connected with identifying of variables of some classes of functions are obtained.

Related

• On the complexity of finite valued functions
• On the minimization k-valued logic functions in the class of disjunctive normal forms
• Logics of variable inclusion and the lattice of consequence relations
• Boolean functions with small second order influences on the discrete cube
• Axiomatizing some small classes of set functions