The following pages link to (Q4542562):
Displaying 13 items.
- Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in (Q654006) (← links)
- Deterministically testing sparse polynomial identities of unbounded degree (Q976069) (← links)
- On the genericity of maximum rank distance and Gabidulin codes (Q1696049) (← links)
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming (Q1887719) (← links)
- A case of depth-3 identity testing, sparse factorization and duality (Q1947039) (← links)
- On hitting-set generators for polynomials that vanish rarely (Q2099672) (← links)
- Random construction of partial MDS codes (Q2306906) (← links)
- Noisy interpolation of sparse polynomials in finite fields (Q2491980) (← links)
- Recent Results on Polynomial Identity Testing (Q3007643) (← links)
- Algebraic Independence and Blackbox Identity Testing (Q3012915) (← links)
- Quantified Derandomization: How to Find Water in the Ocean (Q5060673) (← links)
- (Q6084350) (← links)
- (Q6084351) (← links)
