Pages that link to "Item:Q392031"
From MaRDI portal
The following pages link to On exact algorithms for the permutation CSP (Q392031):
Displaying 8 items.
- Inclusion relationships among permutation problems (Q1106217) (← links)
- Finding and counting permutations via CSPs (Q2041985) (← links)
- Solving static permutation mastermind using \(O(n \log n)\) queries (Q2073315) (← links)
- Certifying algorithms and relevant properties of reversible primitive permutations with \textsf{Lean} (Q2097420) (← links)
- State complexity of permutation and related decision problems on alphabetical pattern constraints (Q2117669) (← links)
- Improved Approximation Algorithm for the Number of Queries Necessary to Identify a Permutation (Q2870055) (← links)
- Solving a permutation problem by a fully polynomial-time approximation scheme (Q3000079) (← links)
- (Q4036996) (← links)