Efficient polynomial algorithms for distributive lattices (Q810071)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient polynomial algorithms for distributive lattices |
scientific article; zbMATH DE number 4212121
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient polynomial algorithms for distributive lattices |
scientific article; zbMATH DE number 4212121 |
Statements
Efficient polynomial algorithms for distributive lattices (English)
0 references
1991
0 references
breadth-first search
0 references
Hasse graph of a distributive lattice
0 references
polynomial problems
0 references
canonical decomposition
0 references
transitive closure
0 references
generation
0 references
recognition
0 references
orientability
0 references
combinatorial algorithm
0 references
0 references
0.8251392841339111
0 references
0.8239601254463196
0 references
0.7765942811965942
0 references
0.7652172446250916
0 references
