Pages that link to "Item:Q4210162"
From MaRDI portal
The following pages link to Reconstructing Algebraic Functions from Mixed Data (Q4210162):
Displaying 9 items.
- Decoding of Reed Solomon codes beyond the error-correction bound (Q1361883) (← links)
- Query complexity of membership comparable sets. (Q1401341) (← links)
- Noisy Chinese remaindering in the Lee norm (Q1827579) (← links)
- Noisy interpolation of sparse polynomials in finite fields (Q2491980) (← links)
- The enumerability of P collapses P to NC (Q2575747) (← links)
- Fitting algebraic curves to noisy data (Q5917581) (← links)
- Pseudorandom generators without the XOR lemma (Q5943089) (← links)
- Approximate evaluations of characteristic polynomials of Boolean functions (Q5958111) (← links)
- Nearly optimal pseudorandomness from hardness (Q6551259) (← links)
