Author image not provided
 Colin Mcquillan

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article2.50
Citation Count10
Publication count4
Publication years2013-2014
Available for download1
Average downloads per article255.00
Downloads (cumulative)255
Downloads (12 Months)15
Downloads (6 Weeks)2
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


4 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 4 of 4
Sort by:

1
October 2014 Journal of Computer and System Sciences: Volume 81 Issue 1, February, 2015
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 0

We consider the problem of approximating the partition function of the hard-core model on planar graphs of degree at most 4. We show that when the activity λ is sufficiently large, there is no fully polynomial randomised approximation scheme for evaluating the partition function unless NP = RP . The ...
Keywords: Hard-core model, Planar graphs, Counting complexity, Independent sets, Phase transition

2
October 2014 Journal of Computer and System Sciences: Volume 81 Issue 1, February, 2015
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 0

We study the complexity of the approximate weighted counting constraint satisfaction problem #CSP ( F ) . In the conservative case, where F contains all unary functions, a classification is known over the Boolean domain; we extend this to arbitrary finite domains. We show that if F is "weakly log-modular", ...
Keywords: Approximation, Constraint satisfaction problems, Counting complexity

3
June 2014 CCC '14: Proceedings of the 2014 IEEE 29th Conference on Computational Complexity
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 1

Given a symmetric DxD matrix M over {0, 1, *}, a list M-partition of a graph G is a partition of the vertices of G into D parts which are associated with the rows of M. The part of each vertex is chosen from a given list in such a ...
Keywords: counting complexity, graph algorithms, dichotomy theorem, graph homomorphism

4 published by ACM
October 2013 Journal of the ACM (JACM): Volume 60 Issue 5, October 2013
Publisher: ACM
Bibliometrics:
Citation Count: 8
Downloads (6 Weeks): 2,   Downloads (12 Months): 15,   Downloads (Overall): 254

Full text available: PDFPDF
An important tool in the study of the complexity of Constraint Satisfaction Problems (CSPs) is the notion of a relational clone, which is the set of all relations expressible using primitive positive formulas over a particular set of base relations. Post's lattice gives a complete classification of all Boolean relational ...
Keywords: Approximation algorithms, computational complexity, constraint satisfaction problems, counting problems



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2019 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us