Counting homomorphisms via hypergraph-based structural restrictions

DOI10.1007/978-3-642-32147-4_34zbMATH Open1370.68123OpenAlexW1637248844MaRDI QIDQ3167641FDOQ3167641

Authors: Tommy Färnqvist 

Publication date: 2 November 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32147-4_34

Recommendations

• The complexity of the counting constraint satisfaction problem
• Towards a dichotomy theorem for the counting constraint satisfaction problem
• The Complexity of the Counting Constraint Satisfaction Problem
• scientific article; zbMATH DE number 7561704
• Approximate Counting CSP Seen from the Other Side

zbMATH Keywords

computational complexityconstraint satisfactioncountinghomomorphismhypergraph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65)

Cited In (3)

• Counting Subgraphs via Homomorphisms
• On counting homomorphisms to directed acyclic graphs
• Counting hypermaps by Egorychev's method

This page was built for publication: Counting homomorphisms via hypergraph-based structural restrictions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3167641)