Hitting Set Generators for Sparse Polynomials over Any Finite Fields

  • Chi-Jen Lu
  • Published 2012 in
    2012 IEEE 27th Conference on Computational…

Abstract

We consider the problem of constructing hitting set generators for sparse multivariate polynomials over any finite fields. Hitting set generators, just as pseudorandom generators, play a fundamental role in the study of derandomization. Pseudorandom generators with a logarithmic seed length are only known for polynomials of a constant degree \cite{Lov09… (More)
DOI: 10.1109/CCC.2012.20

Topics

Cite this paper

@article{Lu2012HittingSG, title={Hitting Set Generators for Sparse Polynomials over Any Finite Fields}, author={Chi-Jen Lu}, journal={2012 IEEE 27th Conference on Computational Complexity}, year={2012}, pages={280-286} }