Resolves fundamental gap in quantum complexity: determining homology of weighted clique complexes is QMA₁-hard with inverse-polynomial spectral gaps. Uses topological gadget encodings and filtered-Hodge theory for complete hardness proof.

Resolves fundamental gap in quantum complexity: determining homology of weighted clique complexes is QMA₁-hard with inverse-polynomial spectral gaps. Uses topological gadget encodings and filtered-Hodge theory for complete hardness proof.
As #AI Closed In on ‘Unique Games’ Proof, Researchers Raced to Beat the Machines
#ComputationalComplexity #Technology
As #AI Closed In on ‘Unique Games’ Proof, Researchers Raced to Beat the Machines
#ComputationalComplexity #Technology
AIによる「Unique Games Conjecture」証明の波紋:人間と機械の競争が理論計算機科学にもたらす変革
AIの数学・計算量理論への進出と、人間研究者による直前のマイルストーン達成の攻防を解説。
#TheoreticalComputerScience #AI #GraphTheory #AutomatedReasoning #ComputationalComplexity