Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functions (Q1802063): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(93)90202-k / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2019683710 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:08, 30 July 2024

scientific article
Language Label Description Also known as
English
Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functions
scientific article

    Statements

    Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functions (English)
    0 references
    0 references
    8 August 1993
    0 references
    threshold circuits
    0 references
    division
    0 references
    lower bounds
    0 references

    Identifiers