The computational complexity of recognizing permutation functions (Q5890844)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6621810
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The computational complexity of recognizing permutation functions |
scientific article; zbMATH DE number 6621810 |
Statements
The computational complexity of recognizing permutation functions (English)
0 references
1 September 2016
0 references
0.9893630743026732
0 references
0.9869920015335084
0 references
0.8444592952728271
0 references
0.8432558178901672
0 references
0.8073511719703674
0 references
