Some algorithms for normality testing irreducible polynomials and computing complexity of the normal polynomials over finite fields

From MaRDI portal
Publication:2910410

zbMATH Open1256.11074MaRDI QIDQ2910410

Author name not available (Why is that?)

Publication date: 11 September 2012

Published in: (Search for Journal in Brave)

Full work available at URL: http://www.m-hikari.com/ams/ams-2012/ams-37-40-2012/index.html



No records found.


No records found.








This page was built for publication: Some algorithms for normality testing irreducible polynomials and computing complexity of the normal polynomials over finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2910410)