J. Cai, A. V. Naik, and D. Sivakumar, On the existence of hard sparse sets under weak reductions, Proc. STACS'96, pp.307-318, 1996.
DOI : 10.1007/3-540-60922-9_26

A. Chistov, Constructing a finite field within a polynomial time, Proc. 7th Soviet Conference on Mathematical Logic, 1984.

A. Chistov, Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic, Proc. 5th International FCT Conference, pp.9-13, 1985.
DOI : 10.1007/BFb0028792

A. Chistov, H. Fournier, L. Gurvits, and P. Koiran, Vandermonde Matrices, NP-Completeness, and Transversal Subspaces, Foundations of Computational Mathematics, vol.3, issue.4, pp.421-427, 2003.
DOI : 10.1007/s10208-002-0076-4

R. Lidl and H. Niederreiter, Finite fields, volume 20 of Encyclopedia of Mathematics and its Applications, 1997.

J. Matou?ek, Lectures on Discrete Geometry, Graduate Texts in Mathematics, vol.212, 2002.
DOI : 10.1007/978-1-4613-0039-7

L. Rónyai, L. Babai, and M. K. Ganapathy, On the number of zero-patterns of a sequence of polynomials, Journal of the American Mathematical Society, vol.14, issue.03, pp.717-735, 2001.
DOI : 10.1090/S0894-0347-01-00367-8

M. Roy and N. Vorobjov, The complexification and degree of a semi-algebraic set, Mathematische Zeitschrift, vol.239, issue.1, pp.131-142, 2002.
DOI : 10.1007/s002090100287

V. Shoup, New algorithms for finding irreducible polynomials over finite fields, Mathematics of Computation, vol.54, issue.189, pp.435-447, 1990.
DOI : 10.1090/S0025-5718-1990-0993933-0