Geometric arguments yield better bounds for threshold circuits and distributed computing (Q1365681): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(95)00005-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2071020383 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Harmonic Analysis of Polynomial Threshold Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Majority gates vs. general weighted threshold gates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359756 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realizing Boolean functions on disjoint sets of variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the synthesis of self-correcting schemes from functional elements with a small number of reliable elements / rank
 
Normal rank

Latest revision as of 18:40, 27 May 2024

scientific article
Language Label Description Also known as
English
Geometric arguments yield better bounds for threshold circuits and distributed computing
scientific article

    Statements

    Geometric arguments yield better bounds for threshold circuits and distributed computing (English)
    0 references
    0 references
    9 September 1997
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Boolean functions
    0 references
    threshold circuit
    0 references
    0 references