Pages that link to "Item:Q5121899"

The following pages link to Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits (Q5121899):

Displaying 12 items.

• Resource trade-offs in syntactically multilinear arithmetic circuits (Q371194) (← links)
• Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits (Q2204092) (← links)
• Balancing syntactically multilinear arithmetic circuits (Q2269004) (← links)
• \(d\)-Galvin families (Q2294104) (← links)
• Slightly improved lower bounds for homogeneous formulas of bounded depth and bounded individual degree (Q2294435) (← links)
• Some lower bound results for set-multilinear arithmetic computations (Q2808533) (← links)
• Small-Depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication with Applications (Q4646460) (← links)
• Towards Optimal Depth Reductions for Syntactically Multilinear Circuits (Q5091237) (← links)
• (Q5092414) (← links)
• A super-quadratic lower bound for depth four arithmetic circuits (Q5092474) (← links)
• Lower bounds for special cases of syntactic multilinear ABPs (Q5919345) (← links)
• A robust version of Hegedűs's lemma, with applications (Q6566590) (← links)