Breaking Generator Symmetry

Details Breaking Generator Symmetry Breaking Generator Symmetry

2009-09-28

arxiv.org/abs/0909.5099v1

Computer Science

Artificial Intelligence

Scientific paper

Dealing with large numbers of symmetries is often problematic. One solution is to focus on just symmetries that generate the symmetry group. Whilst there are special cases where breaking just the symmetries in a generating set is complete, there are also cases where no irredundant generating set eliminates all symmetry. However, focusing on just generators improves tractability. We prove that it is polynomial in the size of the generating set to eliminate all symmetric solutions, but NP-hard to prune all symmetric values. Our proof considers row and column symmetry, a common type of symmetry in matrix models where breaking just generator symmetries is very effective. We show that propagating a conjunction of lexicographical ordering constraints on the rows and columns of a matrix of decision variables is NP-hard.

Affiliated with

Also associated with

No associations

Rating

Breaking Generator Symmetry 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 Breaking Generator Symmetry, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Breaking Generator Symmetry will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-235124