Login / Signup
Hardness of monadic second-order formulae over succinct graphs.
Guilhem Gamard
Pierre Guillon
Kévin Perrot
Guillaume Theyssier
Published in:
CoRR (2023)
Keyphrases
</>
higher order
deductive databases
graph theoretic
graph theory
graph matching
computational complexity
datalog queries
graph structures
graph model
graph structure
phase transition
directed graph
expressive power
np complete
knowledge representation
np hard
subgraph isomorphism
valued logic
neural network