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
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1515/156939205774464521 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2070194947 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Polynomial expansions of Boolean functions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4451649 / rank | |||
Normal rank | |||
Latest revision as of 20:32, 24 June 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
