Name
Abstract | ||
|---|---|---|
In this note we present some algorithms to deal with nearrings, the appropriate algebraic structure to study non-linear functions. This is similar the role of rings in the theory of linear functions or that of groups for permutations. In particular, we give efficient algorithms that deal with big nearrings that are given by a small set of generators. In this context, generating involves composition as well as point-wise addition. In the extreme case, one transformation of a group of order n can generate a set of up to nn transformations. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1145/345542.345568 | ISSAC |
Keywords | Field | DocType |
order n,appropriate algebraic structure,linear function,non-linear transformation,small set,extreme case,big nearrings,efficient algorithm,point-wise addition,non-linear function,linear transformation | Discrete mathematics,Combinatorics,Nonlinear system,Algebra,Algebraic structure,Permutation,Algorithm,Linear function,Small set,Mathematics | Conference |
ISBN | Citations | PageRank |
1-58113-218-2 | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Franz Binder | 1 | 0 | 0.34 |
| Erhard Aichinger | 2 | 2 | 2.92 |
| Jürgen Ecker | 3 | 1 | 1.14 |
| Christof Nöbauer | 4 | 0 | 0.34 |
| Peter Mayr | 5 | 5 | 3.34 |