On computation complexity problems concerning relation algebras

In this paper, we study the computation complexity of some algebraic combinatorial problems that are closely associated with the graph isomorphism problem. The key point of our considerations is a relation algebra which is a combinatorial analog of a cellular algebra. We present upper bounds on the complexity of central algorithms for relation algebras such as finding the standard basis of extensions and intersection of relation algebras. Also, an approach is described to the graph isomorphism problem involving Schurian relation algebras (these algebras arise from the centralizing rings of permutation groups). We also discuss a number of open problems and possible directions for further investigation. Bibliography: 18 titles.