Algorithmic criteria for permutation orthogonal systems over finite fields. (Q5955919): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3216750 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3136948 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4305609 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4023642 / rank | |||
Normal rank | |||
Latest revision as of 22:55, 3 June 2024
scientific article; zbMATH DE number 1707037
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithmic criteria for permutation orthogonal systems over finite fields. |
scientific article; zbMATH DE number 1707037 |
Statements
Algorithmic criteria for permutation orthogonal systems over finite fields. (English)
0 references
18 February 2002
0 references
permutation polynomials
0 references
polynomial maps between two algebraic varieties
0 references
