The following pages link to (Q5417641):
Displaying 8 items.
- Fast Möbius inversion in semimodular lattices and ER-labelable posets (Q311532) (← links)
- On exact algorithms for the permutation CSP (Q392031) (← links)
- A note on exact algorithms for vertex ordering problems on graphs (Q692902) (← links)
- A heuristic to accelerate in-situ permutation algorithms (Q1603509) (← links)
- Solving static permutation mastermind using \(O(n \log n)\) queries (Q2073315) (← 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)
- Improved Information Set Decoding for Code-Based Cryptosystems with Constrained Memory (Q3452571) (← links)
