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

From MaRDI portal
Revision as of 17:06, 20 June 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

    title
    Refined estimates of the number of repetition-free Boolean functions in the full binary basis \(\{\&,\vee,\oplus,-\}\) (English)
    0 references
    publication date
    18 September 2013
    0 references

    Identifiers

     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q368209&oldid=430267"
      Powered by MediaWiki