Implementation complexity of Boolean functions with a small number of ones (Q2050236): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1741461
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Nikolay P. Red'kin / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1515/dma-2021-0024 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3197523268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3245556 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5672822 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of Boolean functions with small number of ones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684582 / rank
 
Normal rank

Latest revision as of 11:50, 26 July 2024

scientific article
Language Label Description Also known as
English
Implementation complexity of Boolean functions with a small number of ones
scientific article

    Statements

    Implementation complexity of Boolean functions with a small number of ones (English)
    0 references
    30 August 2021
    0 references
    Boolean function
    0 references
    Boolean circuit
    0 references
    Shannon function
    0 references
    0 references

    Identifiers