Project Details
Description
Ziel des Projekts sind u.a.
1. der Entwurf von Algorithmen zum Rechnen mit grossen Fastringen
2. der Entwicklung von Effizienten Repraesentationen von Funktionenfastringen
| Status | Finished |
|---|---|
| Effective start/end date | 01.06.1998 → 31.08.1999 |
Fields of science
- 101001 Algebra
- 101 Mathematics
- 101013 Mathematical logic
- 102031 Theoretical computer science
- 101005 Computer algebra
JKU Focus areas
- Digital Transformation
-
The finite 1-affine complete Frobenius groups
Ecker, J., Dec 2003, In: Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg. 73, 1, p. 229 - 239 11 p.Research output: Contribution to journal › Article › peer-review
-
Nearrings whose set of $N$-subgroups is linearly ordered
Morini, F. & Mayr, P., 01 Nov 2002, In: Results in Mathematics. 42, 3-4, p. 339-348 10 p.Research output: Contribution to journal › Article › peer-review
-
Algorithms for finite near-rings and their $N$-groups
Mayr, P. & Binder, F., Jul 2001, In: Journal of Symbolic Computation. 32, 1-2, p. 23-38 16 p.Research output: Contribution to journal › Article › peer-review
Open Access
Activities
- 4 Contributed talk
-
Algorithms for near-rings
Binder, F. (Speaker)
24 Jul 2001Activity: Talk or presentation › Contributed talk › unknown
-
Algorithms for Near-rings of Non-linear Transformations
Binder, F. (Speaker)
08 Aug 2000Activity: Talk or presentation › Contributed talk › unknown
-
On finite fixed-point-free automorphism groups
Mayr, P. (Speaker)
14 Jul 1999Activity: Talk or presentation › Contributed talk › unknown