Using amplification to compute majority with small majority gates (Q677991): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amplification and percolation (probabilistic Boolean functions) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing $O(n\log n)$ Size Monotone Formulae for the <i>k</i>th Threshold Function of <i>n</i> Boolean Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Method of determining lower bounds for the complexity of \(\Pi\)-circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliable circuits using less reliable relays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short monotone formulae for the majority function / rank
 
Normal rank

Latest revision as of 12:07, 27 May 2024

scientific article
Language Label Description Also known as
English
Using amplification to compute majority with small majority gates
scientific article

    Statements