On exact algorithms for the permutation CSP

DOI10.1016/j.tcs.2012.10.035zbMath1358.68137arXiv1203.2801OpenAlexW2115301068MaRDI QIDQ392031

Eun Jung Kim, Daniel Gonçalves

Publication date: 13 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1203.2801

zbMATH Keywords

exact algorithmalgorithmic lower boundpermutation constraint satisfaction problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Cites Work

• Unnamed Item
• Unnamed Item
• A note on exact algorithms for vertex ordering problems on graphs
• Which problems have strongly exponential complexity?
• A new algorithm for optimal 2-constraint satisfaction and its implications
• Scheduling Partially Ordered Jobs Faster Than 2 n
• Set Partitioning via Inclusion-Exclusion
• On Problems as Hard as CNF-SAT
• On the complexity of \(k\)-SAT

This page was built for publication: On exact algorithms for the permutation CSP