Improving the Time Complexity of the Computation of Irreducible and Primitive Polynomials in Finite Fields (bibtex)
by Rifà, Josep and Borrell, Joan
Reference:
Improving the Time Complexity of the Computation of Irreducible and Primitive Polynomials in Finite Fields (Rifà, Josep and Borrell, Joan), In Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 9th International Symposium, AAECC-9, New Orleans, LA, USA, October 7-11, 1991, Proceedings (Mattson, Harold F., Mora, Teo, Rao, T. R. N., eds.), Springer, volume 539, 1991.
Bibtex Entry:
@inproceedings{rifa_improving_1991,
	series = {Lecture {Notes} in {Computer} {Science}},
	title = {Improving the {Time} {Complexity} of the {Computation} of {Irreducible} and {Primitive} {Polynomials} in {Finite} {Fields}},
	volume = {539},
	url = {https://doi.org/10.1007/3-540-54522-0_123},
	doi = {10.1007/3-540-54522-0_123},
	booktitle = {Applied {Algebra}, {Algebraic} {Algorithms} and {Error}-{Correcting} {Codes}, 9th {International} {Symposium}, {AAECC}-9, {New} {Orleans}, {LA}, {USA}, {October} 7-11, 1991, {Proceedings}},
	publisher = {Springer},
	author = {Rifà, Josep and Borrell, Joan},
	editor = {Mattson, Harold F. and Mora, Teo and Rao, T. R. N.},
	year = {1991},
	pages = {352--359}
}
Powered by bibtexbrowser