The following pages link to (Q5752496):
Displaying 17 items.
- To the problem of realizability of Boolean functions by circuits in a basis of unreliable functional elements (Q415657) (← links)
- On the complexity of realizing the powers of a Boolean \((n,n)\)-function (Q1345680) (← links)
- On estimates on the complexity of restrictions of Boolean functions (Q1380287) (← links)
- Generalization of cardinality estimates for plane circuits realizing partial Boolean operators (Q1791622) (← links)
- Complexity of activity tests for partial Boolean functions (Q1820131) (← links)
- Inner-core and outer-core functions of partially defined Boolean functions (Q1961465) (← links)
- The complexity of deciding if a Boolean function can be computed by circuits over a restricted basis (Q2272200) (← links)
- Complexity of sequential implementation of partial Boolean functions (Q2377493) (← links)
- Using Flexibility in P-Circuits by Boolean Relations (Q2985749) (← links)
- (Q3115633) (← links)
- On the complexity of restrictions of Boolean functions (Q3125953) (← links)
- (Q3727865) (← links)
- (Q3972115) (← links)
- Complexity of implementing functions of k-valued logic by circuits and formulas in functionally complete bases (Q4220200) (← links)
- The complexity of Boolean function implementation in some classes of automaton circuits (Q5947815) (← links)
- Average case complexity for finite Boolean functions (Q5954082) (← links)
- Lower bounds for the complexity of restrictions of Boolean functions (Q5954083) (← links)
