pull down to refresh
0 sats \ 0 replies \ @beyond_turbulence OP 3 Dec \ on: Geometric Complexity Topology (GCT) culture
Corollary 6.1:
Any irreducible hole or twist in M implies P ≠ NP under polynomial embeddings.
Application(s):
Computational Complexity: Classify NP-hardness via genus and curvature rather than search trees.