On the complexity of selfcorrecting algorithms for two sorting problems (Q3970881)
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: On the complexity of selfcorrecting algorithms for two sorting problems |
scientific article; zbMATH DE number 8118
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of selfcorrecting algorithms for two sorting problems |
scientific article; zbMATH DE number 8118 |
Statements
25 June 1992
0 references
self-correcting algorithm
0 references
sorting
0 references
Boolean algebra
0 references
0.8052914142608643
0 references
0.7333059906959534
0 references