Tests for permutation functions
DOI10.1006/FFTA.1995.1003zbMATH Open0820.11073OpenAlexW1981913693MaRDI QIDQ1344091FDOQ1344091
Authors: Keju Ma, Joachim von zur Gathen 
Publication date: 9 February 1995
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/ffta.1995.1003
Recommendations
finite fieldpermutation functionpermutation polynomialsopen questionspolynomial-time randomized approximation schemerandom polynomial-time algorithm test
Polynomials over finite fields (11T06) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30)
Cited In (16)
- On the existence of permutations conditioned by certain rational functions
- On a conjecture on permutation rational functions over finite fields
- Functions over finite fields that determine few directions
- PERMUTATION FUNCTIONS ARISING FROM INTERPOLATIONS
- Full classification of permutation rational functions and complete rational functions of degree three over finite fields
- Counting curves and their projections
- Quasi-permutation polynomials.
- Low-degree permutation rational functions over finite fields
- Tests with respect to permutations of variables in Boolean functions
- Constructing permutation rational functions from isogenies
- Rational functions of degree four that permute the projective line over a finite field
- A deterministic test for permutation polynomials
- Permutation Property Testing under Different Metrics with Low Query Complexity
- The computational complexity of recognizing permutation functions
- The computational complexity of recognizing permutation functions
- On a type of permutation rational functions over finite fields
This page was built for publication: Tests for permutation functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1344091)
