Computational Counting

Lead Research Organisation: University of Leeds
Department Name: Sch of Computing

Abstract

Abstracts are not currently available in GtR for all funded research. This is normally because the abstract was not required at the time of proposal submission, but may be because it included sensitive information such as personal details.

Publications

10 25 50
publication icon
Goldberg L (2012) A counterexample to rapid mixing of the Ge-Štefankovic process in Electronic Communications in Probability

publication icon
Dyer M (2012) The complexity of approximating bounded-degree Boolean #CSP in Information and Computation

publication icon
Dyer M (2015) On the chromatic number of a random hypergraph in Journal of Combinatorial Theory, Series B

publication icon
Bulatov A (2012) The complexity of weighted and unweighted #CSP in Journal of Computer and System Sciences

publication icon
Chen X (2015) The complexity of approximating conservative counting CSPs in Journal of Computer and System Sciences

publication icon
Dyer M (2017) On the Switch Markov Chain for Perfect Matchings in Journal of the ACM

publication icon
Bulatov A.A. (2012) Log-supermodular functions, functional clones and counting CSPs in Leibniz International Proceedings in Informatics, LIPIcs

publication icon
Dyer M. (2016) On the switch Markov chain for perfect matchings in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

publication icon
Martin Edward Dyer (Co-Author) (2013) The complexity of approximating conservative counting CSPs

 
Description A decidable dichotomy theorem for counting constraint satisfaction problems.
Exploitation Route Already been used to prove an even more general theorem by Cai and Chen.
Sectors Digital/Communication/Information Technologies (including Software),Education