Article
Licensed
Unlicensed
Requires Authentication
Iteration-free decomposition of strongly dependent functions
-
A. V. Cheremushkin
Published/Copyright:
October 1, 2004
Some results on decomposition of boolean functions are generalised to the case of discrete k-valued functions. Autotopy and isostrophy groups and parameters of functions with non-trivial decompositions are considered.
Published Online: 2004-10-01
Published in Print: 2004-10-01
Copyright 2004, Walter de Gruyter
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Iteration-free decomposition of strongly dependent functions
- The shortest vectors of lattices connected with a linear congruent generator
- On the number of solutions of the equation (x1 + . . . + xn)m = ax1 . . . xn in a finite field
- On average and typical values of sums of pairwise distances for subsets of vertices of the n-dimensional unit cube
- Stability analysis of a strictly efficient solution of a vector problem of Boolean programming in the metric l1
- A family of multivariate χ2-statistics
- A representation of parastrophs of loops and quasigroups
Articles in the same Issue
- Iteration-free decomposition of strongly dependent functions
- The shortest vectors of lattices connected with a linear congruent generator
- On the number of solutions of the equation (x1 + . . . + xn)m = ax1 . . . xn in a finite field
- On average and typical values of sums of pairwise distances for subsets of vertices of the n-dimensional unit cube
- Stability analysis of a strictly efficient solution of a vector problem of Boolean programming in the metric l1
- A family of multivariate χ2-statistics
- A representation of parastrophs of loops and quasigroups
