pdfformat: 

@InProceedings{dyer_et_al:LIPIcs:2010:2466, author = {Martin Dyer and Leslie Ann Goldberg and Markus Jalsenius and David Richerby}, title = {{The Complexity of Approximating BoundedDegree Boolean #CSP}}, booktitle = {27th International Symposium on Theoretical Aspects of Computer Science}, pages = {323334}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897163}, ISSN = {18688969}, year = {2010}, volume = {5}, editor = {JeanYves Marion and Thomas Schwentick}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2010/2466}, URN = {urn:nbn:de:0030drops24669}, doi = {http://dx.doi.org/10.4230/LIPIcs.STACS.2010.2466}, annote = {Keywords: Boolean constraint satisfaction problem, generalized satisfiability, counting, approximation algorithms} }
Keywords:  Boolean constraint satisfaction problem, generalized satisfiability, counting, approximation algorithms  
Seminar:  27th International Symposium on Theoretical Aspects of Computer Science  
Issue date:  2010  
Date of publication:  09.03.2010 