Pages that link to "Item:Q2332856"
From MaRDI portal
The following pages link to On the complexity of bounded-depth circuits and formulas over the basis of fan-in gates (Q2332856):
Displaying 14 items.
- On the computation of Boolean functions by analog circuits of bounded fan-in (Q676434) (← links)
- Asymptotically best synthesis methods for reflexive-recursive circuits (Q830987) (← links)
- On the depth complexity of the counting functions (Q912617) (← links)
- An improved complexity hierarchy on the depth of Boolean functions (Q1138531) (← links)
- The complexity of the parity function in unbounded fan-in, unbounded depth circuits (Q1183575) (← links)
- On the complexity of realizing the powers of a Boolean \((n,n)\)-function (Q1345680) (← links)
- Complexity of Boolean functions over bases with unbounded fan-in gates (Q1350754) (← links)
- On the depth of the storage access function (Q1759122) (← links)
- On the synthesis and complexity of formulae with bounded depth of alternation (Q1759151) (← links)
- Multilevel representation and complexity of circuits of unbounded fan-in gates (Q2027864) (← links)
- High-accuracy bounds of the Shannon function for formula complexity in bases with direct and iterative variables (Q2319831) (← links)
- Computing majority by constant depth majority circuits with low fan-in gates (Q2321926) (← links)
- Depth lower bounds for monotone semi-unbounded fan-in circuits. (Q2773024) (← links)
- Lower bounds for complexity of Boolean circuits of finite depth with arbitrary elements (Q3225912) (← links)
