Pages that link to "Item:Q1107989"
From MaRDI portal
The following pages link to The complexity of symmetric functions in bounded-depth circuits (Q1107989):
Displaying 8 items.
- Tight bounds for the multiplicative complexity of symmetric functions (Q924152) (← links)
- Entropy of contact circuits and lower bounds on their complexity (Q1109754) (← links)
- The complexity of computing symmetric functions using threshold circuits (Q1193637) (← links)
- Bit complexity of breaking and achieving symmetry in chains and rings (extended abstract) (Q2819553) (← links)
- (Q3357542) (← links)
- (Q4036705) (← links)
- On the Probabilistic Degrees of Symmetric Boolean Functions (Q4959660) (← links)
- An exact characterization of symmetric functions in \(qAC^{0}[2]\) (Q5941440) (← links)