Login / Signup
A Note on Hardness under Projections for Graph Isomorphism and Time-Bounded Kolmogorov Complexity.
Eric Allender
Azucena Garvia Bosshard
Amulya Musipatla
Published in:
Electron. Colloquium Comput. Complex. (2020)
Keyphrases
</>
kolmogorov complexity
graph isomorphism
inductive inference
graph mining
graph databases
subgraph isomorphism
np complete
conp complete
complexity measures
phase transition
graph search
graph data
np hard
computational complexity
application domains
information extraction
pairwise