scientific article
From MaRDI portal
Publication:3768941
zbMath0632.06001MaRDI QIDQ3768941
No author found.
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
partially ordered setspolynomial time algorithmsnumber of linear extensionsinformation theoretic lower bound for sorting
Partial orders, general (06A06) Searching and sorting (68P10) Permutations, words, matrices (05A05) Software, source code, etc. for problems pertaining to ordered structures (06-04)
Related Items (3)
Computing the number of mergings with constraints ⋮ Linear extension numbers of \(n\)-element posets ⋮ Linear extensions of N-free orders.
This page was built for publication:
