Criteria for a Boolean function to be a repetition-free in the pre-elementary bases of rank 3 (Q5491214): Difference between revisions
From MaRDI portal
Created a new Item |
Removed claims |
||
| Property / author | |||
| Property / author: Nikolaĭ Alekseevich Peryazev / rank | |||
| Property / author | |||
| Property / author: Ivan K. Sharankhaev / rank | |||
Revision as of 10:38, 13 February 2024
scientific article; zbMATH DE number 5061983
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Criteria for a Boolean function to be a repetition-free in the pre-elementary bases of rank 3 |
scientific article; zbMATH DE number 5061983 |
Statements
Criteria for a Boolean function to be a repetition-free in the pre-elementary bases of rank 3 (English)
0 references
10 October 2006
0 references
remainder functions
0 references
