Efficiently Solving Problems Where the Solutions Form a Group

Authors:
Karen E. Petrie;Christopher Jefferson
Affiliations:
Computing Laboratory, University of Oxford, UK;Computing Laboratory, University of Oxford, UK
Venue:
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Year:
2008

Citing 4
Cited 0

A compact representation for permutation groups

Journal of Algorithms
Breaking Row and Column Symmetries in Matrix Models

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Exploiting structure in symmetry detection for CNF

Proceedings of the 41st annual Design Automation Conference
A parametric filtering algorithm for the graph isomorphism problem

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

Group theory is the mathematical study of symmetry. This paper presents a CP method of efficiently solving group-theoretic problems, where each of the solutions is an element of a group. This method allows us to answer questions in group theory which are computationally unfeasible with traditional CP techniques.