scientific article; zbMATH DE number 1775429
From MaRDI portal
Publication:4542562
Recommendations
Cited in
(20)- On testing for zero polynomials by a set of points with bounded precision.
- On the genericity of maximum rank distance and Gabidulin codes
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
- A case of depth-3 identity testing, sparse factorization and duality
- On hitting-set generators for polynomials that vanish rarely
- Random construction of partial MDS codes
- Noisy interpolation of sparse polynomials in finite fields
- Recent results on polynomial identity testing
- Algebraic independence and blackbox identity testing
- Randomness efficient testing of sparse black box identities of unbounded degree over the reals
- Primality and identity testing via Chinese remaindering
- scientific article; zbMATH DE number 2079409 (Why is no real title available?)
- scientific article; zbMATH DE number 1796989 (Why is no real title available?)
- Quantified Derandomization: How to Find Water in the Ocean
- Randomness efficient identity testing of multivariate polynomials
- On hitting-set generators for polynomials that vanish rarely
- scientific article; zbMATH DE number 7758310 (Why is no real title available?)
- Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in
- Derandomization and absolute reconstruction for sums of powers of linear forms
- Deterministically testing sparse polynomial identities of unbounded degree
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4542562)
