The following pages link to (Q3352964):
Displaying 9 items.
- Separating OR, SUM, and XOR circuits (Q269494) (← links)
- Lower bounds for synchronous circuits and planar circuits (Q1114661) (← links)
- Functions with bounded symmetric communication complexity, programs over commutative monoids, and ACC (Q1317485) (← links)
- The size and depth of layered Boolean circuits (Q1944075) (← links)
- Sparse Boolean equations and circuit lattices (Q2430703) (← links)
- Using Flexibility in P-Circuits by Boolean Relations (Q2985749) (← links)
- (Q3783219) (← links)
- Communication Complexity and Lower Bounds on Multilective Computations (Q4265538) (← links)
- Extensional Uniformity for Boolean Circuits (Q5390592) (← links)
