Login / Signup
A Fine-Grained Analogue of Schaefer's Theorem in P: Dichotomy of Exists^k-Forall-Quantified First-Order Graph Properties.
Karl Bringmann
Nick Fischer
Marvin Künnemann
Published in:
Computational Complexity Conference (2019)
Keyphrases
</>
fine grained
graph properties
coarse grained
graph theoretic
graph theory
higher order
directed graph
access control
first order logic
graph data
maximal cliques
clustering coefficient
databases
data mining techniques
co occurrence
natural language
high level