Abstract
Symmetry is a common feature of many combinatorial problems. Unfortunately eliminating all symmetry from a problem is often computationally intractable. This paper argues that recent parameterized complexity results provide insight into that intractability and help identify special cases in which symmetry can be dealt with more tractably. © 2010 Springer-Verlag.
Cite
CITATION STYLE
APA
Walsh, T. (2010). Parameterized complexity results in symmetry breaking. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6478 LNCS, pp. 4–13). https://doi.org/10.1007/978-3-642-17493-3_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free