Axiomatisability and hardness for universal Horn classes of hypergraphs
From MaRDI portal
Publication:6285256
DOI10.1007/s00012-018-0515-yzbMath1522.08003arXiv1704.02099WikidataQ129956885 ScholiaQ129956885MaRDI QIDQ6285256
Publication date: 7 April 2017
Hypergraphs (05C65) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Model theory of finite structures (03C13) Quasivarieties (08C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
This page was built for publication: Axiomatisability and hardness for universal Horn classes of hypergraphs