On circuits of functional elements of finite depth of branching
From MaRDI portal
depth of branching of a circuit of functional elementslower and upper bounds for complexity of linear Boolean function
Recommendations
- Lower bounds for complexity of Boolean circuits of finite depth with arbitrary elements
- On the depth of Boolean functions over an arbitrary infinite basis
- On the complexity of bounded-depth circuits and formulas over the basis of fan-in gates
- On bounds for complexity of circuits of multi-input functional elements
- On the complexity of realizing the powers of a Boolean (n,n)-function
Cited in
(10)- On the depth of the storage access function
- Formula complexity of a linear function in a \(k\)-ary basis
- On complexity of linear operators on the class of circuits of depth 2
- scientific article; zbMATH DE number 4176986 (Why is no real title available?)
- Lower bounds for complexity of Boolean circuits of finite depth with arbitrary elements
- A note on depth minimization of Boolean systems
- scientific article; zbMATH DE number 3912286 (Why is no real title available?)
- Bounds for code length for circuits of functional elements
- scientific article; zbMATH DE number 524117 (Why is no real title available?)
- New inequality relations between depth and delay
This page was built for publication: On circuits of functional elements of finite depth of branching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5424087)
