On computation complexity problems concerning relation algebras

DOI10.1007/BF02366131zbMath0844.68047MaRDI QIDQ1329260

Ilya Nikolaevich Ponomarenko

Publication date: 25 July 1994

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

zbMATH Keywords

graph isomorphismalgebraic combinatoricscomputation complexity

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

On a new high dimensional Weisfeiler-Lehman algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coherent algebras
• Polynomial time algorithms for recognizing and isomorphism testing of cyclic tour-naments
• 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
• A note on the graph isomorphism counting problem
• Permutation representations
• On the Complexity of Canonical Labeling of Strongly Regular Graphs

This page was built for publication: On computation complexity problems concerning relation algebras