Depth-size tradeoffs for neural computation
From MaRDI portal
Publication:5375430
DOI10.1109/12.106225zbMath1395.68127OpenAlexW2110715393MaRDI QIDQ5375430
Kai-Yeung Siu, Vwani P. Roychowdhury, Thomas Kailath
Publication date: 14 September 2018
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/12.106225
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Related Items
Depth-efficient threshold circuits for multiplication and symmetric function computation ⋮ A size-depth trade-off for the analog computation of Boolean functions ⋮ Threshold circuits of small majority-depth