Sorting Short Keys in Circuits of Size ${o(n \log n)}$ (Q5080485): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q114846589, #quickstatements; #temporary_batch_1711439739529 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q114846589 / rank | |||
Normal rank | |||
Revision as of 21:20, 26 March 2024
scientific article; zbMATH DE number 7534657
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sorting Short Keys in Circuits of Size ${o(n \log n)}$ |
scientific article; zbMATH DE number 7534657 |
Statements
Sorting Short Keys in Circuits of Size ${o(n \log n)}$ (English)
0 references
31 May 2022
0 references
sorting circuit
0 references
compaction
0 references
selection
0 references
