Efficient Algorithms for Computing Chow and Hurwitz Forms of Projective Varieties

The authors present deterministic algorithms with single exponential bit complexity bounds for computing the Chow forms and Hurwitz forms of projective varieties defined over integers.