research
∙
01/10/2022
A full dichotomy for Holant^c, inspired by quantum computation
Holant problems are a family of counting problems parameterised by sets ...
share
research
∙
09/09/2021
Proceedings 18th International Conference on Quantum Physics and Logic
This volume contains the proceedings of the 18th International Conferenc...
research
∙
11/02/2018
Holant clones and the approximability of conservative holant problems
We construct a theory of holant clones to capture the notion of expressi...
research
∙
04/13/2018
Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin
We analyse the complexity of approximate counting constraint satisfactio...
research
∙
09/26/2017
