# Catharine Lo

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.

- Full text PDF available (1)

Learn More

The computational complexity class #P captures the difficulty of counting the satisfying assignments to a boolean formula. In this work, we use basic tools from quantum computation to give a proof that the SO(3) Witten-Reshetikhin-Turaev (WRT) invariant of 3-manifolds is #P-hard to calculate. We then apply this result to a question about the combinatorics… (More)

- Gorjan Alagic, Catharine Lo
- ArXiv
- 2014

- ‹
- 1
- ›