Generating pseudo-random permutations and maximum flow algorithms (Q915489)
From MaRDI portal
!
WARNING
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 4151851
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generating pseudo-random permutations and maximum flow algorithms |
scientific article; zbMATH DE number 4151851 |
Statements
Generating pseudo-random permutations and maximum flow algorithms (English)
0 references
1990
0 references
design of algorithms
0 references
derandomization
0 references
pseudo-random permutations
0 references
longest common ascending subsequence
0 references
randomized maximum-flow algorithm
0 references
0.8318562507629395
0 references
0.8318562507629395
0 references
0.7923970818519592
0 references
