Parameterized Complexity Results in Symmetry Breaking
Artificial Intelligence
2015-05-19 v1 Computational Complexity
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
Cite
@article{arxiv.1009.1174,
title = {Parameterized Complexity Results in Symmetry Breaking},
author = {Toby Walsh},
journal= {arXiv preprint arXiv:1009.1174},
year = {2015}
}
Comments
Invited talk at IPEC 2010, 5th International Symposium on Parameterized and Exact Computation, December 13-15, 2010, Chennai, India http://www.imsc.res.in/ipec