Pages that link to "Item:Q1320441"
From MaRDI portal
The following pages link to The complexity of sparse polynomial interpolation over finite fields (Q1320441):
Displaying 19 items.
- Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in (Q654006) (← links)
- On the decidability of sparse univariate polynomial interpolation (Q685722) (← links)
- Testing polynomials (Q755792) (← links)
- Deterministically testing sparse polynomial identities of unbounded degree (Q976069) (← links)
- On zero-testing and interpolation of \(k\)-sparse multivariate polynomials over finite fields (Q1178687) (← links)
- On some approximation problems concerning sparse polynomials over finite fields (Q1351508) (← links)
- Zero testing of \(p\)-adic and modular polynomials (Q1575936) (← links)
- Exploring crypto dark matter: new simple PRF candidates and their applications (Q1631360) (← links)
- Polynomial interpolation and identity testing from high powers over finite fields (Q1709581) (← links)
- Identity testing and interpolation from high powers of polynomials of large degree over finite fields (Q1791682) (← links)
- The interpolation problem for \(k\)-sparse polynomials and character sums (Q1814140) (← links)
- Noisy interpolation of sparse polynomials in finite fields (Q2491980) (← links)
- Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
- Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix (Q2985828) (← links)
- (Q3135191) (← links)
- Noisy Interpolation of Multivariate Sparse Polynomials in Finite Fields (Q3656824) (← links)
- Complexity of sparse polynomial solving 2: renormalization (Q6171578) (← links)
- Orders of Gauss periods in finite fields (Q6487964) (← links)
- Fast interpolation of multivariate polynomials with sparse exponents (Q6665433) (← links)
