Pages that link to "Item:Q970107"

The following pages link to Entropy of operators or why matrix multiplication is hard for depth-two circuits (Q970107):

Displaying 3 items.

• Min-rank conjecture for log-depth circuits (Q657911) (← links)
• Lower bounds for complexity of Boolean circuits of finite depth with arbitrary elements (Q3225912) (← links)
• Lower Bounds for Depth-2 and Depth-3 Boolean Circuits with Arbitrary Gates (Q3503631) (← links)