SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Computational Complexity

Volumn 2, Issue 3, 1992, Pages 187-224

Computing Frobenius maps and factoring polynomials

(2) von zur Gathen, Joachim a Shoup, Victor a

a UNIVERSITY OF TORONTO (Canada)

Author keywords

Subject classifications: 68Q40, 11Y16, 12Y05

Indexed keywords

EID: 0001605828 PISSN: 10163328 EISSN: 14208954 Source Type: Journal
DOI: 10.1007/BF01272074 Document Type: Article

Times cited : (139)

References (42)

1
- 84934213477
- A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.

2
- 0010739711
- Über Kongruenzen von dem fünften und höheren Graden nach einem Primzahlmodulus
- (1918) Arkiv för matematik, astronomi o. fysik , vol.14 , pp. 1-46
- Arwin, A.¹

3
- 84934213478
- L. Babai, E. M. Luks, and Á. Seress. Fast management of permutation groups. In 29th Annual Symposium on Foundations of Computer Science, 272–282, 1988.

4
- 0005478995
- The complexity of computing partial derivatives
- (1983) Theoret. Comput. Sci. , vol.22 , pp. 317-330
- Baur, W.¹ Strassen, V.²

5
- 84934213465
- M. Ben-Or. Probabilistic algorithms in finite fields. In 22nd Annual Symposium on Foundations of Computer Science, 394–398, 1981.

6
- 84934213467
- E. R. Berlekamp. Algebraic Coding Theory. McGraw-Hill, 1968.

7
- 84968518238
- Factoring polynomials over large finite fields
- (1970) Mathematics of Computation , vol.24 , pp. 713-735
- Berlekamp, E.R.¹

8
- 84934213466
- A. Borodin and I. Munro. The Computational Complexity of Algebraic and Numeric Problems. American Elsevier, 1975.

9
- 0018019849
- Fast algorithms for manipulating formal power series
- (1978) J. Assoc. Comput. Mach. , vol.25 , pp. 581-595
- Brent, R.P.¹ Kung, H.T.²

10
- 84934213471
- J. Buchmann. Complexity of algorithms in algebraic number theory. In Number Theory. Proc. First Conf. Canadian Number Theory Assoc., 37–53. Walter de Gruyter, 1990.

11
- 0346466821
- On the reducibility of polynomials over a finite field
- (1954) Quart. J. Math., Oxford Ser. , vol.5 , Issue.2 , pp. 102-107
- Butler, M.C.R.¹

12
- 0020749812
- Improving an algorithm for factoring polynomials over a finite field and constructing large irreducible polynomials
- (1983) IEEE Transactions on Information Theory , vol.29 , pp. 378-385
- Camion, P.¹

13
- 84934213472
- J. F. Canny, E. Kaltofen, and L. Yagati. Solving systems of non-linear polynomial equations faster. In Proc. Int. Symp. on Symbolic and Algebraic Comp., 121–128, 1989.

14
- 34249916280
- On fast multiplication of polynomials over arbitrary algebras
- (1991) Acta. Inf. , vol.28 , pp. 693-701
- Cantor, D.G.¹ Kaltofen, E.²

15
- 84966220369
- A new algorithm for factoring polynomials over finite fields
- (1981) Mathematics of Computation , vol.36 , pp. 587-592
- Cantor, D.G.¹ Zassenhaus, H.²

16
- 85023205150
- Matrix multiplication via arithmetic progressions
- (1990) J. Symb. Comp. , vol.9 , pp. 23-52
- Coppersmith, D.¹ Winograd, S.²

17
- 84934213473
- T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to algorithms. MIT Press, 1989.

18
- 0020828328
- Irreducibility of multivariate polynomials
- (1985) J. Computer System Sciences , vol.31 , pp. 225-264
- von zur Gathen, J.¹

19
- 0023564107
- Factoring polynomials and primitive elements for special primes
- (1987) Theoret. Comput. Sci. , vol.52 , pp. 77-89
- von zur Gathen, J.¹

20
- 84968492649
- Constructing normal bases in finite fields
- (1990) Journal of Symbolic Computation , vol.10 , pp. 547-570
- von zur Gathen, J.¹ Giesbrecht, M.²

21
- 0026124008
- Boolean circuits versus arithmetic circuits
- (1991) Inform. and Comput. , vol.91 , pp. 142-154
- von zur Gathen, J.¹ Seroussi, G.²

22
- 84934213474
- G. H. Hardy and E. M. Wright. An Introduction to the Theory of Numbers. Oxford University Press, fifth edition, 1984.

23
- 84934213468
- E. Kaltofen. Polynomial factorization 1982–1986. In Computers in Mathematics, ed. D. V. Chudnovsky, R. D. Jenks, Lecture Notes in Pure and Applied Mathematics, vol. 125, 285–309, 1990.

24
- 0040170055
- Addition requirements for matrix and transposed matrix products
- (1988) J. of Algorithms , vol.9 , pp. 354-364
- Kaminski, M.¹ Kirkpatrick, D.G.² Bshouty, N.H.³

25
- 84934213469
- D. E. Knuth. The Art of Computer Programming, vol. 2. Addison-Wesley, second edition, 1981.

26
- 84934213470
- R. Lidl and H. Niederreiter. Finite Fields. Addison-Wesley, 1983.

27
- 84968468141
- Factorization of polynomials over finite fields
- (1969) Mathematics of Computation , vol.23 , pp. 861-867
- McEliece, R.J.¹

28
- 0347069922
- Subgroup refinement algorithms for root finding in GF(q)
- (1992) SIAM Journal on Computing , vol.21 , pp. 228-239
- Menezes, A.J.¹ van Oorschot, P.C.² Vanstone, S.A.³

29
- 0347097043
- Calcul des racines d-ièmes dans un corps fini
- (1988) C. R. Acad. Sci. Paris , vol.290 , pp. 205-206
- Mignotte, M.¹ Schnorr, C.²

30
- 84966201137
- On the efficiency of algorithms for polynomial factoring
- (1977) Mathematics of Computation , vol.31 , pp. 235-250
- Moenck, R.T.¹

31
- 84934213411
- A. M. Odlyzko. Discrete logarithms in finite fields and their cryptographic significance. In Advances in Cryptology, Proceedings of Eurocrypt 84, 224–314. Springer-Verlag, 1985.

32
- 0001262977
- Probabilistic algorithms in finite fields
- (1980) SIAM Journal on Computing , vol.9 , pp. 273-280
- Rabin, M.O.¹

33
- 0000256895
- Schnelle Multiplikation von Polynomen über Körpern der Charakteristik 2
- (1977) Acta Inf. , vol.7 , pp. 395-398
- Schönhage, A.¹

34
- 34250459760
- Schnelle Multiplikation großer Zahlen
- (1971) Computing , vol.7 , pp. 281-292
- Schönhage, A.¹ Strassen, V.²

35
- 0025258153
- On the deterministic complexity of factoring polynomials over finite fields
- (1990) Inform. Process. Lett. , vol.33 , pp. 261-267
- Shoup, V.¹

36
- 84934213412
- V. Shoup. A fast deterministic algorithm for factoring polynomials over finite fields of small characteristic. In Proc. Int. Symp. on Symbolic and Algebraic Comp., 14–21, 1991.

37
- 84934213409
- V. Shoup. Fast construction of irreducible polynomials over finite fields. In Proc. IEEE Symp. on Discrete Algorithms, Austin, TX, 1993.

38
- 84934213410
- V. Shoup and R. Smolensky. An algorithm for modular composition. Preprint, 1992.

39
- 84934213420
- I. E. Shparlinski. Computational problems in finite fields. Kluwer, 1992. To appear.

40
- 0001977576
- The computational complexity of continued fractions
- (1983) SIAM Journal on Computing , vol.12 , pp. 1-27
- Strassen, V.¹

41
- 0347097023
- A deterministic algorithm for factorizing polynomials over extensions GF(p^m) of GF(p), p a small prime
- (1989) J. of Information and Optimization Sciences , vol.10 , pp. 337-344
- Thiong ly, A.¹

42
- 84934213419
- D. Y. Y. Yun. On square-free decomposition algorithms. In Proc. ACM Symp. Symbolic and Algebraic Comp., 26–35, 1976.

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.