Rectifier circuits of bounded depth
From MaRDI portal
Publication:4553646
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
Cites work
- scientific article; zbMATH DE number 3121508 (Why is no real title available?)
- scientific article; zbMATH DE number 609921 (Why is no real title available?)
- scientific article; zbMATH DE number 3311395 (Why is no real title available?)
- scientific article; zbMATH DE number 3322450 (Why is no real title available?)
- An application of the method of additive chains to inversion in finite fields
- Complexity of Linear Boolean Operators
- On addition chains
- On the Evaluation of Powers and Monomials
- On the complexity of calculating systems of monomials with restrictions on the powers of variables
- The minimum number of edges in graphs with prescribed paths
Cited in
(5)
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)