Go to the corresponding LIPIcs Volume Portal 
Cai, JinYi ; Szabo, Daniel P.
pdfformat: 

@InProceedings{cai_et_al:LIPIcs.MFCS.2022.27, author = {Cai, JinYi and Szabo, Daniel P.}, title = {{Bounded Degree Nonnegative Counting CSP}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {27:127:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772563}, ISSN = {18688969}, year = {2022}, volume = {241}, editor = {Szeider, Stefan and Ganian, Robert and Silva, Alexandra}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2022/16825}, URN = {urn:nbn:de:0030drops168250}, doi = {10.4230/LIPIcs.MFCS.2022.27}, annote = {Keywords: Computational Counting Complexity, Constraint Satisfaction Problems, Counting CSPs, Complexity Dichotomy, Nonnegative Counting CSP, Graph Homomorphisms} }
Keywords:  Computational Counting Complexity, Constraint Satisfaction Problems, Counting CSPs, Complexity Dichotomy, Nonnegative Counting CSP, Graph Homomorphisms  
Collection:  47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)  
Issue Date:  2022  
Date of publication:  22.08.2022 