Monotone Boolean functions capture their primes (Q2253712): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Prescribing the binary digits of primes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Fourier-Walsh spectrum of the Moebius function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distribution of the values of \(q\)-additive functions on polynomial sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Fourier spectrum of monotone functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primes with an average sum of digits / rank
 
Normal rank
Property / cites work
 
Property / cites work: On (Not) Computing the Möbius Function Using Bounded Depth Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4103446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4830109 / rank
 
Normal rank

Revision as of 17:16, 9 July 2024

scientific article
Language Label Description Also known as
English
Monotone Boolean functions capture their primes
scientific article

    Statements

    Monotone Boolean functions capture their primes (English)
    0 references
    12 February 2015
    0 references
    Boolean functions
    0 references
    binary expansion
    0 references
    primes
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references