An efficient parallel algorithm for building the separating tree (Q666141)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An efficient parallel algorithm for building the separating tree |
scientific article; zbMATH DE number 6012853
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient parallel algorithm for building the separating tree |
scientific article; zbMATH DE number 6012853 |
Statements
An efficient parallel algorithm for building the separating tree (English)
0 references
7 March 2012
0 references
parallel algorithms
0 references
separable permutation
0 references
0 references
0 references
0.8555259704589844
0 references
0.7597554922103882
0 references
0.7587475180625916
0 references
0.7417015433311462
0 references
0.7412276864051819
0 references
