Powering requires threshold depth 3 (Q845974): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1016/j.ipl.2006.11.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2050739958 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The expressive power of voting polynomials / 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: Simulating Threshold Circuits by Majority Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold circuits of bounded depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4284623 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On small depth threshold circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Power of Threshold Circuits with Small Weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth efficient neural networks for division and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Optimal Depth Threshold Circuits for Multiplication and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functions / rank
 
Normal rank

Latest revision as of 10:59, 2 July 2024

scientific article
Language Label Description Also known as
English
Powering requires threshold depth 3
scientific article

    Statements