An efficient algorithm for saving ordered sets in a compacted form (Q3477938): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/00207169008803863 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2061348060 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Biplanes (56,11,2) with automorphisms of order 4 fixing some point / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Biplanes (56,11,2) with automorphism group \(Z_ 2\times Z_ 2\) fixing some point / rank | |||
Normal rank | |||
Latest revision as of 15:45, 20 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient algorithm for saving ordered sets in a compacted form |
scientific article |
Statements
An efficient algorithm for saving ordered sets in a compacted form (English)
0 references
1990
0 references
ordered sets
0 references
factorial base
0 references
data compaction and compression
0 references
