On computation complexity problems concerning relation algebras
type: Item
instance of: scholarly article
title: On computation complexity problems concerning relation algebras
zbMATH Open document ID: 0844.68047
DOI: 10.1007/BF02366131
published in: Journal of Mathematical Sciences (New York)
publication date: 1994-07-25T00:00:00Z
review text: See the review in Zbl 0807.68036.
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 598780
zbMATH Keywords: computation complexity
zbMATH Keywords: algebraic combinatorics
zbMATH Keywords: graph isomorphism
author: Ilya Ponomarenko
MaRDI profile type: Publication
cites work: Q4091421
cites work: Q3218140
cites work: Q3312272
cites work: Q3974847
cites work: Polynomial time algorithms for recognizing and isomorphism testing of cyclic tour-naments
cites work: On the Complexity of Canonical Labeling of Strongly Regular Graphs
cites work: Coherent algebras
cites work: A note on the graph isomorphism counting problem
cites work: On construction and identification of graphs. With contributions by A. Lehman, G. M. Adelson-Velsky, V. Arlazarov, I. Faragev, A. Uskov, I. Zuev, M. Rosenfeld and B. Weisfeiler
cites work: Permutation representations
Recommended article: Q3364101
Recommended article: Q4032851
Recommended article: Q4729350
Recommended article: Complexity of equational theory of relational algebras with standard projection elements
Recommended article: Q3707409
Recommended article: Q3339290
Recommended article: On the Complexity of the Equational Theory of Relational Action Algebras
Recommended article: On the complexity of deciding typability in the relational algebra
Recommended article: The complexity of constraint satisfaction problems for small relation algebras
Recommended article: Complexity of equations valid in algebras of relations. II: Finite axiomatizations
description: scientific article; zbMATH DE number 598780