Some algorithms for normality testing irreducible polynomials and computing complexity of the normal polynomials over finite fields
type: Item
instance of: scholarly article
zbMATH Open document ID: 1256.11074
author: Mahmood Alizadeh
publication date: 2012-09-11T00:00:00Z
full work available at URL: index.html
Mathematics Subject Classification ID: 11Y16
Mathematics Subject Classification ID: 11T06
zbMATH DE Number: 6080708
zbMATH Keywords: complexity
zbMATH Keywords: irreducible polynomial
zbMATH Keywords: normal polynomial
MaRDI profile type: Publication
title: Some algorithms for normality testing irreducible polynomials and computing complexity of the normal polynomials over finite fields
published in: Applied Mathematical Sciences (Ruse)
description: scientific article; zbMATH DE number 6080708