Pages that link to "Item:Q2800773"
From MaRDI portal
The following pages link to The complexity of counting poset and permutation patterns (Q2800773):
Displaying 5 items.
- Posets and permutations in the duplication-loss model: minimal permutations with \(d\) descents (Q974742) (← links)
- Counting two-dimensional posets (Q1332438) (← links)
- Finding and counting permutations via CSPs (Q2041985) (← links)
- (Q4390670) (← links)
- Counting Pop-Stacked Permutations in Polynomial Time (Q6042966) (← links)