홈 > Term: partial order
partial order
An order defined for some, but not necessarily all, pairs of items. For instance, the sets (a, b) and (a, c, d) are subsets of (a, b, c, d), but neither is a subset of the other. So "subset of" is a partial order on sets. Formal Definition: A partial order is a binary relation that is reflexive, transitive, and antisymmetric.
- 품사: noun
- 분야/도메인: 컴퓨터 과학
- 카테고리: Algorithms & data structures
- Government Agency: NIST
0
작성자
- GeorgeV
- 100% positive feedback