An algorithmic proof that semiorders are representable (Q3990620)

From MaRDI portal
Revision as of 00:39, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
An algorithmic proof that semiorders are representable
scientific article

    Statements

    title
    An algorithmic proof that semiorders are representable (English)
    0 references
    author
    P. J. Avery
    0 references
    publication date
    28 June 1992
    0 references
    zbMATH Keywords
    preference patterns with intransitive indifference
    0 references
    asymmetric digraph
    0 references
    semiorder
    0 references

    Identifiers

    Mathematics Subject Classification ID
    06A06
    0 references
    05C20
    0 references
    68Q25
    0 references
    zbMATH DE Number
    38397
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3990620&oldid=25447334"
    Powered by MediaWiki