Pages that link to "Item:Q2041985"
From MaRDI portal
The following pages link to Finding and counting permutations via CSPs (Q2041985):
Displaying 12 items.
- On exact algorithms for the permutation CSP (Q392031) (← links)
- Algorithms for testing occurrences of length 4 patterns in permutations (Q1698070) (← links)
- The complexity of counting poset and permutation patterns (Q2800773) (← links)
- (Q4017150) (← links)
- Permutation patterns are hard to count (Q4575645) (← links)
- Four Shorts Stories on Surprising Algorithmic Uses of Treewidth (Q5042454) (← links)
- Counting and Generating Permutations Using Timed Languages (Q5405068) (← links)
- Finding and Counting Permutations via CSPs (Q5875533) (← links)
- Parity permutation pattern matching (Q6070786) (← links)
- Finding and counting permutations via CSPs (Q6323601) (← links)
- Strongly sublinear algorithms for testing pattern freeness (Q6566461) (← links)
- Parity permutation pattern matching (Q6586663) (← links)