Parameterized Complexity Results in Symmetry Breaking

Details Parameterized Complexity Results in Symmetry Breaking Parameterized Complexity Results in Symmetry Breaking

2010-09-06

arxiv.org/abs/1009.1174v1

Computer Science

Artificial Intelligence

Invited talk at IPEC 2010, 5th International Symposium on Parameterized and Exact Computation, December 13-15, 2010, Chennai,

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

Parameterized Complexity Results in Symmetry Breaking does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Parameterized Complexity Results in Symmetry Breaking, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parameterized Complexity Results in Symmetry Breaking will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-703891