Rectifier circuits of bounded depth

DOI10.1134/S1990478918010143zbMATH Open1413.68064OpenAlexW2789517576MaRDI QIDQ4553646FDOQ4553646

Authors: I. S. Sergeev 

Publication date: 30 October 2018

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1990478918010143

Recommendations

• On realization complexity of linear Boolean transformations by schemes of depth 3
• scientific article; zbMATH DE number 3423920
• Fractional coverings, greedy coverings, and rectifier networks
• On the complexity of bounded-depth circuits and formulas over the basis of fan-in gates
• Lower bounds for complexity of Boolean circuits of finite depth with arbitrary elements

zbMATH Keywords

computational complexityBoolean matricesbounded depthrectifier circuits

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Boolean and Hadamard matrices (15B34)

Cites Work

• Title not available (Why is that?)
• On the Evaluation of Powers and Monomials
• Complexity of Linear Boolean Operators
• On addition chains
• An application of the method of additive chains to inversion in finite fields
• Title not available (Why is that?)
• The minimum number of edges in graphs with prescribed paths
• Title not available (Why is that?)
• On the complexity of calculating systems of monomials with restrictions on the powers of variables
• Title not available (Why is that?)

Cited In (5)

• Lower bounds on the graver complexity of \(M\)-fold matrices
• On the additive complexity of some integer sequences
• Overdamped non-contact rectifiers
• Fractional coverings, greedy coverings, and rectifier networks
• Orbits of the R-L-diode circuit

This page was built for publication: Rectifier circuits of bounded depth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4553646)