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: 14th International conference, CP 2008, Sydney, Australia, September 14-18 2008: proceedings
EditorsP. J. Stuckey
PublisherSpringer
Pages529-533
Number of pages5
ISBN (Print)978-3-540-85957-4
DOIs
Publication statusPublished - 2008

Publication series

NameLecture Notes in Computer Science
Volume5202
ISSN (Print)0302-9743

Fingerprint

Dive into the research topics of 'Efficiently Solving Problems Where the Solutions Form a Group'. Together they form a unique fingerprint.

Cite this