Sign Up to like & get
recommendations!
1
Published in 2018 at "Journal of Applied and Industrial Mathematics"
DOI: 10.1134/s1990478918010143
Abstract: Asymptotically tight bounds are obtained for the complexity of computation of the classes of (m, n)-matrices with entries from the set {0, 1,..., q − 1} by rectifier circuits of bounded depth d, under some…
read more here.
Keywords:
rectifier circuits;
bounded depth;
circuits bounded;