Consecutive ones property and PQ-trees for multisets: hardness of counting their orderings (Q690497)
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: Consecutive ones property and PQ-trees for multisets: hardness of counting their orderings |
scientific article; zbMATH DE number 6110708
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Consecutive ones property and PQ-trees for multisets: hardness of counting their orderings |
scientific article; zbMATH DE number 6110708 |
Statements
Consecutive ones property and PQ-trees for multisets: hardness of counting their orderings (English)
0 references
27 November 2012
0 references
sequences with repeated symbols
0 references
multisets
0 references
consecutive ones property
0 references
counting permutations
0 references
PQ-trees
0 references
complexity
0 references
0 references
