Testing polynomials over general fields

@article{Kaufman2004TestingPO,
  title={Testing polynomials over general fields},
  author={Tali Kaufman and Dana Ron},
  journal={45th Annual IEEE Symposium on Foundations of Computer Science},
  year={2004},
  pages={413-422}
}
In this work we fill in the knowledge gap concerning testing polynomials over finite fields. As previous works show, when the cardinality of the field, q, is sufficiently larger than the degree bound, d, then the number of queries sufficient for testing is polynomial or even linear in d. On the other hand, when q = 2 then the number of queries, both sufficient and necessary, grows exponentially with d. Here we study the intermediate case where 2 < q /spl les/ O(d) and show a smooth transition… CONTINUE READING
Highly Cited
This paper has 89 citations. REVIEW CITATIONS

Topics

Statistics

051015'05'07'09'11'13'15'17
Citations per Year

89 Citations

Semantic Scholar estimates that this publication has 89 citations based on the available data.

See our FAQ for additional information.