Pages that link to "Item:Q3068644"
From MaRDI portal
The following pages link to Hardness of Reconstructing Multivariate Polynomials over Finite Fields (Q3068644):
Displaying 6 items.
- Random low-degree polynomials are hard to approximate (Q430841) (← links)
- On the hardness of learning intersections of two halfspaces (Q619909) (← links)
- Reconstruction algorithms for sums of affine powers (Q2284961) (← links)
- Learning polynomials with queries: The highly noisy case (Q2706184) (← links)
- NP-Hardness of Reed--Solomon Decoding, and the Prouhet--Tarry--Escott Problem (Q4581908) (← links)
- (Q5743431) (← links)