Skip to main content
Journal ArticleOPEN ACCESS

A geometrical approach to multiset orderings

Theoretical Computer Science (1989) 67(1) 37-54
DOI: 10.1016/0304-3975(89)90020-0
14Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We survey different ways of ordering multisets, and give a classification of multiset orderings based on the notion of a cone in Rn. This enables us to derive new results about the dominance ordering and the standard multiset ordering. © 1989.

Cite

CITATION STYLE

APA

Martin, U. (1989). A geometrical approach to multiset orderings. Theoretical Computer Science, 67(1), 37–54. https://doi.org/10.1016/0304-3975(89)90020-0

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free