Projektdatenbank (ab 2004)

Projektnummer

0062797

Zusammenfassung

For over 20 years, the most fundamental search algorithms in computer algebra have been built around partitions. Partitions only store the information whether or not two values of a set are in the same orbit under the permutation action of a particular group. This leads to search trees that are unnecessarily large, because redundant work is performed (potentially very often). In this project the usage of graphs instead of partitions as the fundamental data structure in search algorithms will be investigated. Graphs allow for much richer and more complex relations to be expressed. The m...