Pages that link to "Item:Q3521931"
From MaRDI portal
The following pages link to Asymptotically Optimal Hitting Sets Against Polynomials (Q3521931):
Displaying 11 items.
- Building above read-once polynomials: identity testing and hardness of representation (Q727964) (← links)
- Deterministically testing sparse polynomial identities of unbounded degree (Q976069) (← links)
- On hitting-set generators for polynomials that vanish rarely (Q2099672) (← links)
- A note on parameterized polynomial identity testing using hitting set generators (Q2274524) (← links)
- Sharp concentration of hitting size for random set systems (Q2345531) (← links)
- Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
- Randomness efficient testing of sparse black box identities of unbounded degree over the reals (Q3113719) (← links)
- Optimal Hitting Sets for Combinatorial Shapes (Q3167414) (← links)
- Optimal hitting sets for combinatorial shapes (Q3191583) (← links)
- Quantified Derandomization: How to Find Water in the Ocean (Q5060673) (← links)
- (Q6084351) (← links)