Go to the corresponding LIPIcs Volume Portal 
Scheidt, Benjamin ; Schweikardt, Nicole
pdfformat: 

@InProceedings{scheidt_et_al:LIPIcs.MFCS.2023.79, author = {Scheidt, Benjamin and Schweikardt, Nicole}, title = {{Counting Homomorphisms from Hypergraphs of Bounded Generalised Hypertree Width: A Logical Characterisation}}, booktitle = {48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)}, pages = {79:179:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772921}, ISSN = {18688969}, year = {2023}, volume = {272}, editor = {Leroux, J\'{e}r\^{o}me and Lombardy, Sylvain and Peleg, David}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2023/18613}, URN = {urn:nbn:de:0030drops186131}, doi = {10.4230/LIPIcs.MFCS.2023.79}, annote = {Keywords: counting logics, guarded logics, homomorphism counting, hypertree decompositions, hypergraphs, incidence graphs, quantum graphs} }
Keywords:  counting logics, guarded logics, homomorphism counting, hypertree decompositions, hypergraphs, incidence graphs, quantum graphs  
Collection:  48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)  
Issue Date:  2023  
Date of publication:  21.08.2023 