Pages that link to "Item:Q3586180"

The following pages link to Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits (Q3586180):

Displaying 22 items.

• Subexponential size hitting sets for bounded depth multilinear formulas (Q301528) (← links)
• Factors of low individual degree polynomials (Q301529) (← links)
• Read-once polynomial identity testing (Q496300) (← links)
• Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds (Q645124) (← links)
• Deterministic polynomial identity tests for multilinear bounded-read formulae (Q901932) (← links)
• Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits (Q1630382) (← links)
• Sums of read-once formulas: how many summands are necessary? (Q1686070) (← links)
• Improved hitting set for orbit of ROABPs (Q2087774) (← links)
• Equivalence of polynomial identity testing and polynomial factorization (Q2351391) (← links)
• Uniform derandomization from pathetic lower bounds (Q2941601) (← links)
• Recent Results on Polynomial Identity Testing (Q3007643) (← links)
• On the Size of Homogeneous and of Depth-Four Formulas with Low Individual Degree (Q4612480) (← links)
• (Q4612482) (← links)
• (Q5002654) (← links)
• (Q5028363) (← links)
• A generalized sylvester-gallai type theorem for quadratic polynomials (Q5092455) (← links)
• (Q5092463) (← links)
• (Q5092488) (← links)
• (Q5121901) (← links)
• Sylvester-Gallai type theorems for quadratic polynomials (Q5126776) (← links)
• Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring (Q5889792) (← links)
• Schur polynomials do not have small formulas if the determinant does not (Q6113104) (← links)