The following pages link to (Q4036705):
Displaying 7 items.
- Bounded-depth, polynomial-size circuits for symmetric functions (Q1063574) (← links)
- Functions with bounded symmetric communication complexity, programs over commutative monoids, and ACC (Q1317485) (← links)
- Optimal depth, very small size circuits for symmetric functions in \(AC^ 0\) (Q1322486) (← links)
- First-order expressibility of languages with neutral letters or: The Crane Beach conjecture (Q1776372) (← links)
- Evaluating spectral norms for constant depth circuits with symmetric gates (Q1904669) (← links)
- Computation of level-\(0\) kernels of symmetric logic functions (Q2704952) (← links)
- (Q3357542) (← links)
