Q3364101
type: Item
instance of: scholarly article
zbMATH Open document ID: 0807.68036
publication date: 1992-01-01T00:00:00Z
full work available at URL: https://eudml.org/doc/68320
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 4217898
zbMATH Keywords: computation complexity
zbMATH Keywords: algebraic combinatorics
zbMATH Keywords: graph isomorphism
author: Ilya Ponomarenko
MaRDI profile type: Publication
Recommended article: On computation complexity problems concerning relation algebras
Recommended article: Q4032851
Recommended article: Complexity of equational theory of relational algebras with standard projection elements
Recommended article: Q4729350
Recommended article: Q4000534
Recommended article: Q5315662
Recommended article: On the complexity of deciding typability in the relational algebra
Recommended article: Q3339290
Recommended article: On Complete Problems, Relativizations and Logics for Complexity Classes
Recommended article: Q3780509
description: scientific article