A fast bit-parallel algorithm for computing the subset partial order (Q1293872)
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: A fast bit-parallel algorithm for computing the subset partial order |
scientific article; zbMATH DE number 1310392
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast bit-parallel algorithm for computing the subset partial order |
scientific article; zbMATH DE number 1310392 |
Statements
A fast bit-parallel algorithm for computing the subset partial order (English)
0 references
12 January 2000
0 references
combinatorial set theory
0 references
0.9169685244560242
0 references
0.8564486503601074
0 references
0.8508760929107666
0 references
0.8052944540977478
0 references
0.7753158807754517
0 references
