The following pages link to (Q3972115):
Displaying 7 items.
- To the problem of realizability of Boolean functions by circuits in a basis of unreliable functional elements (Q415657) (← links)
- On the VC-dimension of depth four threshold circuits and the complexity of Boolean-valued functions (Q1367525) (← links)
- Complexity of implementing functions of k-valued logic by circuits and formulas in functionally complete bases (Q4220200) (← links)
- (Q4301458) (← links)
- Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity (Q5368767) (← links)
- (Q5752496) (← links)
- The complexity of Boolean function implementation in some classes of automaton circuits (Q5947815) (← links)
