Login / Signup
Axiomatisability and hardness for universal Horn classes of hypergraphs.
Lucy Ham
Marcel Jackson
Published in:
CoRR (2017)
Keyphrases
</>
np hard
phase transition
propositional logic
computational complexity
special case
learning theory
graph theory
data sets
case study
search space
np complete
class hierarchy