Login / Signup
Orthogonal Vectors is hard for first-order properties on sparse graphs.
Jiawei Gao
Russell Impagliazzo
Published in:
Electron. Colloquium Comput. Complex. (2016)
Keyphrases
</>
graph properties
directed graph
graph matching
structural properties
desirable properties
graph theoretic
first order logic
algebraic structures
graph partitioning
sparse data
topological properties
feature vectors
np complete
weighted graph
graph databases