Algorithm for studying polynomial maps and reductions modulo prime number
暂无分享,去创建一个
[1] A. V. D. Essen,et al. Polynomial Automorphisms and the Jacobian Conjecture , 2000, Frontiers in Mathematics.
[2] L. A. Campbell. Reduction Theorems for the Strong Real Jacobian Conjecture , 2013, 1303.3853.
[3] Injective polynomial maps and the Jacobian conjecture , 1983 .
[4] Michael Rosen,et al. A classical introduction to modern number theory , 1982, Graduate texts in mathematics.
[5] Stefan Maubach,et al. POLYNOMIAL AUTOMORPHISMS OVER FINITE FIELDS , 2001 .
[6] Jean-Charles Faugère,et al. On the complexity of the F5 Gröbner basis algorithm , 2013, J. Symb. Comput..
[8] T. Crespo,et al. An effective study of polynomial maps , 2017 .
[9] S. Maubach,et al. Keller Maps of Low Degree over Finite Fields , 2014 .
[10] S. Maubach,et al. Locally finite polynomial endomorphisms , 2007 .