SCOPUS 정보 검색 플랫폼

Volumn 29, Issue 4, 2001, Pages 1759-1772

The groups of order qn · p

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035534533 PISSN: 00927872 EISSN: None Source Type: Journal
DOI: 10.1081/AGB-100002131 Document Type: Article

Times cited : (9)

References (12)

1
- 0033112558
- Construction of finite groups
- H. U. Besche and B. Eick. Construction of finite groups, J. Symbolic Comput. 27 (1999), 387-404.
- (1999) J. Symbolic Comput. , vol.27 , pp. 387-404
- Besche, H.U.¹ Eick, B.²

2
- 0033110657
- The groups of order at most 1000 except 512 and 768
- H. U. Besche and B. Eick. The groups of order at most 1000 except 512 and 768, J. Symbolic Comput. 27 (1999), 405-413.
- (1999) J. Symbolic Comput. , vol.27 , pp. 405-413
- Besche, H.U.¹ Eick, B.²

3
- 84886585843
- Available with GAP 4
- H. U. Besche, B. Eick and E. A. O'Brien. The Small Groups library. Available with GAP 4. See also http://www.mathematik.uni-kassel.de/~eick/.
- The Small Groups Library
- Besche, H.U.¹ Eick, B.² O'Brien, E.A.³

5
- 0039110577
- Enumerating p-groups
- B. Eick and E. A. O'Brien. Enumerating p-groups. J. Austral. Math. Soc. (Series A) 67 (1999), 191-205.
- (1999) J. Austral. Math. Soc. (Series A) , vol.67 , pp. 191-205
- Eick, B.¹ O'Brien, E.A.²

6
- 0007259928
- In preparation
- B. Eick, C. R. Leedham-Green and E. A. O'Brien. Computing automorphism groups of p-groups. In preparation.
- Computing Automorphism Groups of P-groups
- Eick, B.¹ Leedham-Green, C.R.² O'Brien, E.A.³

7
- 0003500502
- Lehrstuhl D für Mathematik, RWTH Aachen, Germany and School of Mathematical and Computational Sciences, U. St. Andrews, Scotland
- The GAP Team. GAP - Groups, Algorithms and Programming. Lehrstuhl D für Mathematik, RWTH Aachen, Germany and School of Mathematical and Computational Sciences, U. St. Andrews, Scotland. Available from: http://www-gap.dcs.st-and.ac.uk/~gap/.
- GAP - Groups, Algorithms and Programming

8
- 0000940168
- 4
- 4. Math. Ann. 43 (1893), 301-412.
- (1893) Math. Ann. , vol.43 , pp. 301-412
- Hölder, O.¹

10
- 38149145913
- Computing a set of generators of minimal cardinality in a solvable group
- A. Luccini and F. Menegazzo. Computing a set of generators of minimal cardinality in a solvable group. J. Symbolic Comput. 17 (1994), 409-420.
- (1994) J. Symbolic Comput. , vol.17 , pp. 409-420
- Luccini, A.¹ Menegazzo, F.²

11
- 0000219687
- The p-group generation algorithm
- E. A. O'Brien. The p-group generation algorithm. J. Symbolic Comput. 9 (1990), 677-698.
- (1990) J. Symbolic Comput. , vol.9 , pp. 677-698
- O'Brien, E.A.¹

12
- 0001582262
- The groups of order 256
- E. A. O'Brien. The groups of order 256. J. Algebra 143 (1991), 219-235.
- (1991) J. Algebra , vol.143 , pp. 219-235
- O'Brien, E.A.¹

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