LAUSR

Invariant Computation in a Poset

Sign Up to like & get
recommendations!
0 Published in 2021 at "Order"

DOI: 10.1007/s11083-021-09559-2

Abstract: Kong and Ribemboim (1994) define for every poset P a sequence P = D0(P), D(P), D2(P), D3(P)… of posets, where Di(P) = D(Di− 1(P)) consists of all maximal antichains of Di− 1(P). They prove that for a… read more here.

Keywords: computation poset; invariant computation; poset;