Abstract

A double-coset enumeration algorithm for groups generated by symmetric sets of involutions together with its computer implementation is described.