Efficiently solving problems where the solutions form a group

Karen E. Petrie, Christopher Jefferson

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    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.

    Original languageEnglish
    Title of host publicationPrinciples and Practice of Constraint Programming
    Subtitle of host publication14th International Conference, CP 2008, Sydney, Australia, September 14-18, 2008. Proceedings
    EditorsPeter J. Stuckey
    Place of PublicationBerlin
    PublisherSpringer
    Pages529-533
    Number of pages5
    ISBN (Print)9783540859574
    DOIs
    Publication statusPublished - 2008
    Event14th International Conference on Principles and Practice of Constraint Programming - Sydney, Australia
    Duration: 14 Sep 200818 Sep 2008

    Publication series

    NameLecture notes in computer science
    PublisherSpringer
    Volume5202
    ISSN (Print)0302-9743

    Conference

    Conference14th International Conference on Principles and Practice of Constraint Programming
    Abbreviated titleCP 2008
    CountryAustralia
    CitySydney
    Period14/09/0818/09/08

    Cite this

    Petrie, K. E., & Jefferson, C. (2008). Efficiently solving problems where the solutions form a group. In P. J. Stuckey (Ed.), Principles and Practice of Constraint Programming: 14th International Conference, CP 2008, Sydney, Australia, September 14-18, 2008. Proceedings (pp. 529-533). (Lecture notes in computer science; Vol. 5202). Springer . https://doi.org/10.1007/978-3-540-85958-1_36