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.
Chapter PDF
References
Armstrong, M.A.: Groups and Symmetry. Springer, Heidelberg (2000)
Jerrum, M.: A compact presentation for permutation groups. J. Algorithms 7, 71–90 (2002)
Sorlin, S., Solnon, C.: A parametric filtering algorithm for the graph isomorphism problem. Journal of constraints (December 2008)
Flener, P., Frisch, A.M., Hnich, B., Kiziltan, Z., Miguel, I., Pearson, J., Walsh, T.: Breaking row and column symmetries in matrix models. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 462–476. Springer, Heidelberg (2002)
McKay, B.: Practical graph isomorphism. In: Proc. 10th Manitoba Conf. on Numerical mathematics and computing, Winnipeg/Manitoba 1980, Congr. Numerantium, vol. 30, pp. 45–87 (1981), http://cs.anu.edu.au/people/bdm/nauty
Darga, P.T., Liffiton, M.H., Sakallah, K.A., Markov, I.L.: Exploiting structure in symmetry detection for cnf. In: DAC 2004: Proceedings of the 41st annual conference on Design automation, pp. 530–534. ACM, New York (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Petrie, K.E., Jefferson, C. (2008). Efficiently Solving Problems Where the Solutions Form a Group. In: Stuckey, P.J. (eds) Principles and Practice of Constraint Programming. CP 2008. Lecture Notes in Computer Science, vol 5202. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85958-1_36
Download citation
DOI: https://doi.org/10.1007/978-3-540-85958-1_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85957-4
Online ISBN: 978-3-540-85958-1
eBook Packages: Computer ScienceComputer Science (R0)