The following pages link to (Q5302074):
Displaying 10 items.
- Subexponential size hitting sets for bounded depth multilinear formulas (Q301528) (← links)
- Random arithmetic formulas can be reconstructed efficiently (Q488050) (← links)
- Read-once polynomial identity testing (Q496300) (← links)
- Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in (Q654006) (← links)
- Building above read-once polynomials: identity testing and hardness of representation (Q727964) (← links)
- Deterministic polynomial identity tests for multilinear bounded-read formulae (Q901932) (← links)
- A note on parameterized polynomial identity testing using hitting set generators (Q2274524) (← links)
- Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
- Monomials, multilinearity and identity testing in simple read-restricted circuits (Q2637354) (← links)
- Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-$D$ Occur-$k$ Formulas and Depth-3 Transcendence Degree-$k$ Circuits (Q2817792) (← links)
