Computing threshold functions by depth-3 threshold circuits with smaller thresholds of their gates (Q672256): 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/0020-0190(95)00137-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1980226746 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Top-down lower bounds for depth-three circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5606602 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pi-sigma-pi threshold formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: On small depth threshold circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(n^{{\Omega{}}(\log{} n)}\) lower bounds on the size of depth-3 threshold circuits with AND gates at the bottom / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221885 / rank
 
Normal rank

Latest revision as of 11:16, 27 May 2024

scientific article
Language Label Description Also known as
English
Computing threshold functions by depth-3 threshold circuits with smaller thresholds of their gates
scientific article

    Statements

    Computing threshold functions by depth-3 threshold circuits with smaller thresholds of their gates (English)
    0 references
    28 February 1997
    0 references
    0 references
    Computational complexity
    0 references
    Threshold circuits
    0 references
    Lower bounds
    0 references
    0 references
    0 references