Go to the corresponding LIPIcs Volume Portal 
pdfformat: 

@InProceedings{lin_et_al:LIPIcs:2017:7384, author = {Jiabao Lin and Hanpin Wang}, title = {{The Complexity of Holant Problems over Boolean Domain with NonNegative Weights}}, booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)}, pages = {29:129:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770415}, ISSN = {18688969}, year = {2017}, volume = {80}, editor = {Ioannis Chatzigiannakis and Piotr Indyk and Fabian Kuhn and Anca Muscholl}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7384}, URN = {urn:nbn:de:0030drops73846}, doi = {10.4230/LIPIcs.ICALP.2017.29}, annote = {Keywords: counting complexity, dichotomy, Holant, #CSP} }
Keywords:  counting complexity, dichotomy, Holant, #CSP  
Seminar:  44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)  
Issue Date:  2017  
Date of publication:  06.07.2017 