The computational complexity of recognizing permutation functions

DOI10.1145/195058.195204zbMath1345.68177OpenAlexW2007033129MaRDI QIDQ5890844

Keju Ma, Joachim von zur Gathen

Publication date: 1 September 2016

Published in: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/195058.195204

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16)

Related Items (1)

Permutation polynomials modulo \(2^w\)

This page was built for publication: The computational complexity of recognizing permutation functions