scientific article

zbMATH Open0807.68036MaRDI QIDQ3364101

Ilya Ponomarenko

Publication date: 1992

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

Title of this publication is not available (Why is that?)

zbMATH Keywords

graph isomorphismalgebraic combinatoricscomputation complexity

Mathematics Subject Classification ID

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

Related Items (3)

On computation complexity problems concerning relation algebras ⋮ Solving Algorithmic Problems on Orders and Lattices by Relation Algebra and RelView ⋮ Complexity of equational theory of relational algebras with standard projection elements

Recommendations

• Complexity of equational theory of relational algebras with standard projection elements 👍 👎
• On computation complexity problems concerning relation algebras 👍 👎
• On the complexity of deciding typability in the relational algebra 👍 👎
• On Complete Problems, Relativizations and Logics for Complexity Classes 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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)