The complexity of modular counting in constraint satisfaction problems
Constraint Satisfaction Problems are a broad class of combinatorial problems, including several classical decision problems such as graph colouring and SAT, and a range of problems' from other areas, including statistical physics, DNA sequencing and scheduling problems. There are a variety of d...
| Main Author: | |
|---|---|
| Published: |
Queen Mary, University of London
2012
|
| Subjects: | |
| Online Access: | https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.555139 |