Pages that link to "Item:Q3980810"
From MaRDI portal
The following pages link to Complexity of realization of symmetric Boolean functions by switching circuits (Q3980810):
Displaying 9 items.
- Lower bounds of the complexity of symmetric Boolean functions of contact- rectifier circuits (Q1173769) (← links)
- The complexity of the standard multiplexer function in a class of switching circuits (Q2095998) (← links)
- Complexity and structure of near-minimal contact circuits for elementary symmetric functions (Q2519400) (← links)
- (Q3197333) (← links)
- (Q3360126) (← links)
- Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold Gates (Q3608869) (← links)
- (Q4027169) (← links)
- (Q4301458) (← links)
- Properties of Switch-List Representations of Boolean Functions (Q5130011) (← links)