A space-time tradeoff for permutation problems

MaRDI QIDQ5417641zbMATH OpenFDO

Authors Mikko Koivisto, Pekka Parviainen

Publication date 22 May 2014

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Dynamic programming (90C39)

Recommendations

• On exact algorithms for the permutation CSP
• A note on exact algorithms for vertex ordering problems on graphs
• scientific article; zbMATH DE number 1617282
• On the feedback vertex set problem in permutation graphs
• scientific article; zbMATH DE number 512913

Cited in

(8)

• A heuristic to accelerate in-situ permutation algorithms
• Solving static permutation mastermind using \(O(n \log n)\) queries
• Improved Approximation Algorithm for the Number of Queries Necessary to Identify a Permutation
• Solving a permutation problem by a fully polynomial-time approximation scheme
• Fast Möbius inversion in semimodular lattices and ER-labelable posets
• Improved information set decoding for code-based cryptosystems with constrained memory
• On exact algorithms for the permutation CSP
• A note on exact algorithms for vertex ordering problems on graphs

This page was built for publication: A space-time tradeoff for permutation problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5417641)