Browsing Queen Mary University of London Theses by Author "Faben, John"

Now showing items 1-1 of 1

    • The Complexity of Modular Counting in Constraint Satisfaction Problems. 

      Faben, John (Queen Mary University of London, 2012-04)
      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 ...