Complexity is simple!Under what circuit assumptions can Lloyd's computational bound constrain holographic complexity, and can violations inferred from complexity = action support an argument for the Weak Gravity Conjecture?
Source ID: unit:d2a12752d0aa84d05f49b7409a55167a03de25746c18123504da4cf0a445e05f
Archived source locator: {"paperId":"1710.01175","sourceSha256":"fc4f8992b690b85e7f6ab814428590ad48306501365c93ef2320f571da827835","pages":[3,4],"evidenceRefs":["source-graph:ev:10918adcc9f46f341a5d54fdf1854167","source-graph:ev:2d36d04bb7f8b81107b1dd2ff7b3e1b6","source-graph:ev:798ee0b437af6d8b180adcabddbe7d9c"]}
Optional complete source context (gzip JSON). Exact source-object relations retain their own scope; they do not imply relations between entire topics.