Refined estimates of the number of repetition-free Boolean functions in the full binary basis \(\{\&,\vee,\oplus,-\}\) (Q368209)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Refined estimates of the number of repetition-free Boolean functions in the full binary basis \(\{\&,\vee,\oplus,-\}\) |
scientific article; zbMATH DE number 6209071
| 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; zbMATH DE number 6209071 |
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
0.924737811088562
0 references
0.9111728072166444
0 references
