Abstract :
In recent years, considerable interest has been given to the study of threshold logic. This interest stems primarily from the possible economic savings associated with the use of threshold elements in realizing arbitrary switching functions. Such realizations, for the most part, depend on successfully finding threshold functions that closely approximate the given function. Closeness of approximation as defined here means that the approximating threshold function has the smallest set of error vectors with respect to the given function.
Keywords :
M function, minimal threshold approximation, residual vectors, self-dual functions, threshold function, unateness.; Computer science; Dynamic programming; Linear approximation; Linear programming; Logic; Mixed integer linear programming; Network synthesis; M function, minimal threshold approximation, residual vectors, self-dual functions, threshold function, unateness.;
