Computational problems in the theory of finite fields-Reference-Cited by-同舟云学术

Computational problems in the theory of finite fields

Published:1991-06 Issue:2 Volume:2 Page:81-89
ISSN:0938-1279
Container-title:Applicable Algebra in Engineering, Communication and Computing
language:en
Short-container-title:AAECC

Author:

Lidl Rudolf

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Algebra and Number Theory

Link

http://link.springer.com/content/pdf/10.1007/BF01810569.pdf

Reference59 articles.

1. Alagar, V. S., Thanh, M.: Fast polynomial decomposition algorithms. In: Proc. EUROCAL 85, Lecture Notes in Computer Science, pp. 150–153. Berlin, Heidelberg, New York: Springer 1985

2. Ash, D. W., Blake, I. F., Vanstone, S. A.: Low complexity normal bases. Discr. Appl. Math.25, 191–210 (1989)

3. Barton, D. R., Zippel, R.: Polynomial decomposition algorithms. J. Symb. Comp.1, 159–168 (1985)

4. Ben-Or, M.: Probabilistic algorithms in finite fields. Proc. 22nd IEEE Symp. Found. Comput. Sci. 394–398 (1981)

5. Beth, T.: On the arithmetics of Galois fields and the like. Lecture Notes in Comp. Sci. vol. 229, pp. 2–16. Berlin, Heidelberg, New York: Springer 1986

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Construction of logarithm tables for Galois Fields;International Journal of Mathematical Education in Science and Technology;2011-01-15

2. Univariate polynomial factorization over finite fields;Theoretical Computer Science;1998-01

3. Finite Fields and Their Applications;Handbook of Algebra;1996

4. PRIMITIVE NORMAL POLYNOMIALS OVER FINITE-FIELDS;MATH COMPUT;1994