On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\). (Q1978699): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q62472235, #quickstatements; #temporary_batch_1710328330639
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Short Discreet Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4331740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994882 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4320535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multiplicative complexity of quadratic boolean forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds to Complexities of Networks for Sorting and for Switching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3206314 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the combinational complexity of certain symmetric Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3762226 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0304-3975(99)00182-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2091423939 / rank
 
Normal rank

Latest revision as of 09:11, 30 July 2024

scientific article
Language Label Description Also known as
English
On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\).
scientific article

    Statements

    On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\). (English)
    0 references
    0 references
    0 references
    0 references
    4 June 2000
    0 references

    Identifiers