An algorithmic proof that semiorders are representable (Q3990620): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0196-6774(92)90010-a / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1996944372 / rank | |||
Normal rank | |||
Latest revision as of 10:30, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithmic proof that semiorders are representable |
scientific article |
Statements
An algorithmic proof that semiorders are representable (English)
0 references
28 June 1992
0 references
preference patterns with intransitive indifference
0 references
asymmetric digraph
0 references
semiorder
0 references
