Skip to content

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

A Complete Proof of $\mathsf{QMA}_1$-Hardness for Weighted Gapped Clique Homology

The computational complexity of simplicial homology has been studied since the question was raised by Kaibel and Pfetsch, and clique homology was later shown to be $\mathsf{QMA}_1$-hard by Crichigno and Kohler. King and Kohler subsequently introduced the weighted, spectrally gapped version considered here and developed...

Tal Barak · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.