Refined estimates of the number of repetition-free Boolean functions in the full binary basis \(\{\&,\vee,\oplus,-\}\) (Q368209): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 06E30 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05A16 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 94C10 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6209071 / rank
 
Normal rank
Property / zbMATH Keywords
 
repetition-free Boolean function
Property / zbMATH Keywords: repetition-free Boolean function / rank
 
Normal rank
Property / zbMATH Keywords
 
full binary basis
Property / zbMATH Keywords: full binary basis / rank
 
Normal rank
Property / zbMATH Keywords
 
binary function
Property / zbMATH Keywords: binary function / rank
 
Normal rank
Property / zbMATH Keywords
 
Fibonacci numbers
Property / zbMATH Keywords: Fibonacci numbers / rank
 
Normal rank
Property / zbMATH Keywords
 
Euler numbers
Property / zbMATH Keywords: Euler numbers / rank
 
Normal rank
Property / zbMATH Keywords
 
index-preserving structure
Property / zbMATH Keywords: index-preserving structure / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

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

    Identifiers