Pages that link to "Item:Q626617"

The following pages link to Lower bounds and separations for constant depth multilinear circuits (Q626617):

Displaying 47 items.

• Lower bounds for depth-three arithmetic circuits with small bottom fanin (Q301527) (← links)
• Subexponential size hitting sets for bounded depth multilinear formulas (Q301528) (← links)
• Arithmetic circuits: the chasm at depth four gets wider (Q442109) (← links)
• Read-once polynomial identity testing (Q496300) (← links)
• The NOF multiparty communication complexity of composed functions (Q496305) (← links)
• Deterministic polynomial identity tests for multilinear bounded-read formulae (Q901932) (← links)
• Lower bounds for constant-depth circuits in the presence of help bits (Q917289) (← links)
• Nonlinear lower bounds on the number of processors of circuits with sublinear separators (Q1183605) (← links)
• Deterministic identity testing for sum of read-once oblivious arithmetic branching programs (Q1686835) (← links)
• Multi-\(k\)-ic depth three circuit lower bound (Q1694000) (← links)
• Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits (Q2204092) (← links)
• Balancing syntactically multilinear arithmetic circuits (Q2269004) (← links)
• Average-case linear matrix factorization and reconstruction of low width algebraic branching programs (Q2281256) (← links)
• Slightly improved lower bounds for homogeneous formulas of bounded depth and bounded individual degree (Q2294435) (← links)
• Lower bounds and PIT for non-commutative arithmetic circuits with restricted parse trees (Q2323361) (← links)
• Unifying known lower bounds via geometric complexity theory (Q2351393) (← links)
• Depth lower bounds for monotone semi-unbounded fan-in circuits. (Q2773024) (← links)
• Algebraic Complexity Classes (Q2821695) (← links)
• A Selection of Lower Bounds for Arithmetic Circuits (Q2821696) (← links)
• Uniform derandomization from pathetic lower bounds (Q2941601) (← links)
• Lower Bounds for Depth-4 Formulas Computing Iterated Matrix Multiplication (Q2949210) (← links)
• An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas (Q2968156) (← links)
• Separation of multilinear circuit and formula size (Q3002768) (← links)
• Permanent Does Not Have Succinct Polynomial Size Arithmetic Circuits of Constant Depth (Q3012845) (← links)
• ON THE HARDNESS AGAINST CONSTANT-DEPTH LINEAR-SIZE CIRCUITS (Q3084685) (← links)
• Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications. (Q3304115) (← links)
• Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity (Q3392953) (← links)
• On the Size of Homogeneous and of Depth-Four Formulas with Low Individual Degree (Q4612480) (← links)
• (Q4612482) (← links)
• Small-Depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication with Applications (Q4646460) (← links)
• Barriers for Rank Methods in Arithmetic Complexity (Q4993264) (← links)
• A Quadratic Size-Hierarchy Theorem for Small-Depth Multilinear Formulas (Q5002707) (← links)
• (Q5028363) (← links)
• Towards Optimal Depth Reductions for Syntactically Multilinear Circuits (Q5091237) (← links)
• (Q5092414) (← links)
• On the Symmetries of and Equivalence Test for Design Polynomials. (Q5092415) (← links)
• A super-quadratic lower bound for depth four arithmetic circuits (Q5092474) (← links)
• On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions (Q5098770) (← links)
• Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits (Q5121899) (← links)
• Hardness vs randomness for bounded depth arithmetic circuits (Q5121901) (← links)
• On Expressing Majority as a Majority of Majorities (Q5220471) (← links)
• Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits (Q5254013) (← links)
• Lower bounds for constant query affine-invariant LCCs and LTCs (Q5368746) (← links)
• Approaching the Chasm at Depth Four (Q5501936) (← links)
• Non-commutative circuits and the sum-of-squares problem (Q5892594) (← links)
• Lower bounds for special cases of syntactic multilinear ABPs (Q5919345) (← links)
• Lower bounds for the sum of small-size algebraic branching programs (Q6636102) (← links)