scientific article; zbMATH DE number 4217898

MaRDI QIDQ3364101zbMATH OpenFDO

Authors Ilya Ponomarenko

Publication date 1992

Full work available at URL https://eudml.org/doc/68320

zbMATH Keywords

algebraic combinatoricscomputation complexitygraph isomorphism

Mathematics Subject Classification ID

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

Recommendations

• On computation complexity problems concerning relation algebras
• scientific article; zbMATH DE number 150219
• Complexity of equational theory of relational algebras with standard projection elements
• scientific article; zbMATH DE number 4114007
• scientific article; zbMATH DE number 54351
• scientific article; zbMATH DE number 2203952
• On the complexity of deciding typability in the relational algebra
• scientific article; zbMATH DE number 3872682
• On complete problems, relativizations and logics for complexity classes
• scientific article; zbMATH DE number 4043325

Cited in

(6)

• On computation complexity problems concerning relation algebras
• A fast coset-translation algorithm for computing the cycle structure of Comer relation algebras over \(\mathbb{Z} / p \mathbb{Z}\)
• Solving Algorithmic Problems on Orders and Lattices by Relation Algebra and RelView
• scientific article; zbMATH DE number 1507184 (Why is no real title available?)
• Complexity of equational theory of relational algebras with standard projection elements
• Isomorphism of sets of relations

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3364101)