The following pages link to (Q3775483):
Displaying 11 items.
- The complexity of Boolean functions in different characteristics (Q626677) (← links)
- On the Fourier spectrum of symmetric Boolean functions (Q987559) (← links)
- The complexity of computing symmetric functions using threshold circuits (Q1193637) (← links)
- On the complexity of balanced Boolean functions (Q1606934) (← links)
- Upper bounds on the multiplicative complexity of symmetric Boolean functions (Q2179499) (← links)
- Competitive Boolean function evaluation: beyond monotonicity, and the symmetric case (Q2275907) (← links)
- On the positive and the inversion complexity of Boolean functions (Q3142263) (← links)
- Bit complexity of breaking and achieving symmetry in chains and rings (Q3546359) (← links)
- Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold Gates (Q3608869) (← links)
- (Q4301458) (← links)
- Diameter Versus Certificate Complexity of Boolean Functions (Q6168445) (← links)