The following pages link to (Q3197333):
Displaying 8 items.
- Lower bounds to the complexity of symmetric Boolean functions (Q914382) (← links)
- Circuit complexity of linear functions: gate elimination and feeble security (Q1946842) (← links)
- (Q3364203) (← links)
- (Q3822102) (← links)
- Complexity of realization of symmetric Boolean functions by switching circuits (Q3980810) (← links)
- Comparing the sizes of nondeterministic branching read-k-times programs (Q4268146) (← links)
- (Q4301458) (← links)
- Algorithms and lower bounds for comparator circuits from shrinkage (Q6107895) (← links)