pdfformat: 

@InProceedings{guo_et_al:LIPIcs:2011:3015, author = {Heng Guo and Sangxia Huang and Pinyan Lu and Mingji Xia}, title = {{The Complexity of Weighted Boolean #CSP Modulo k}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011) }, pages = {249260}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897255}, ISSN = {18688969}, year = {2011}, volume = {9}, editor = {Thomas Schwentick and Christoph D{\"u}rr}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3015}, URN = {urn:nbn:de:0030drops30158}, doi = {http://dx.doi.org/10.4230/LIPIcs.STACS.2011.249}, annote = {Keywords: #CSP, dichotomy theorem, counting problems, computational complexity} }
Keywords:  #CSP, dichotomy theorem, counting problems, computational complexity  
Seminar:  28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)  
Issue date:  2011  
Date of publication:  2011 