Refined estimates of the number of repetition-free Boolean functions in the full binary basis \(\{\&,\vee,\oplus,-\}\) (Q368209): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4451647 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2748260 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Asymptotics of the number of repetition-free Boolean functions in the elementary basis / rank | |||
Normal rank | |||
Latest revision as of 20:52, 6 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Refined estimates of the number of repetition-free Boolean functions in the full binary basis \(\{\&,\vee,\oplus,-\}\) |
scientific article |
Statements
Refined estimates of the number of repetition-free Boolean functions in the full binary basis \(\{\&,\vee,\oplus,-\}\) (English)
0 references
18 September 2013
0 references
repetition-free Boolean function
0 references
full binary basis
0 references
binary function
0 references
Fibonacci numbers
0 references
Euler numbers
0 references
index-preserving structure
0 references
