Article
Licensed
Unlicensed
Requires Authentication
Criteria for a Boolean function to be a repetition-free in the pre-elementary bases of rank 3
-
N. A. Peryazev
Published/Copyright:
May 1, 2005
We study representations of Boolean functions by formulas and describe in terms of remainder functions the classes of repetition-free Boolean functions in the pre-elementary bases
Published Online: 2005-05-01
Published in Print: 2005-05-01
Copyright 2005, 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
- A power divergence test in the problem of sample homogeneity for large numbers of outcomes and trials
- The Poisson approximation for the number of matches of values of a discrete function on segments of a sequence of random variables
- A theorem on probabilities of large deviations for decomposable statistics which do not satisfy the Cramér condition
- An upper bound for the number of functions satisfying the strict avalanche criterion
- Adjustment experiments for automata with variable logic of behaviour
- Equational closure
- Criteria for a Boolean function to be a repetition-free in the pre-elementary bases of rank 3
- On the length of checking test for repetition-free functions in the basis {0, 1, &, ∨, ¬}
- Touchard C-polynomials and quasi-orthogonal to them polynomials
Articles in the same Issue
- A power divergence test in the problem of sample homogeneity for large numbers of outcomes and trials
- The Poisson approximation for the number of matches of values of a discrete function on segments of a sequence of random variables
- A theorem on probabilities of large deviations for decomposable statistics which do not satisfy the Cramér condition
- An upper bound for the number of functions satisfying the strict avalanche criterion
- Adjustment experiments for automata with variable logic of behaviour
- Equational closure
- Criteria for a Boolean function to be a repetition-free in the pre-elementary bases of rank 3
- On the length of checking test for repetition-free functions in the basis {0, 1, &, ∨, ¬}
- Touchard C-polynomials and quasi-orthogonal to them polynomials
