Enumerating homomorphisms
type: Item
instance of: scholarly article
title: Enumerating homomorphisms
zbMATH Open document ID: 1253.68165
author: Andrei A. Bulatov
author: Martin Grohe
author: Dániel Marx
author: Víctor Dalmau
published in: Journal of Computer and System Sciences
publication date: 2012-05-11T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 68R05
zbMATH DE Number: 6033516
zbMATH Keywords: enumeration
zbMATH Keywords: computational complexity
zbMATH Keywords: homomorphisms
zbMATH Keywords: constraint satisfaction
MaRDI profile type: Publication
full work available at URL: j.jcss.2011.09.006
OpenAlex ID: W2914039150
cites work: Size bounds and query plans for relational joins
cites work: Towards Sharp Inapproximability for Any 2-CSP
cites work: The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell)
cites work: The complexity of temporal constraint satisfaction problems
cites work: Q4291429
cites work: Towards a dichotomy theorem for the counting constraint satisfaction problem
cites work: The complexity of partition functions
cites work: A dichotomy theorem for constraint satisfaction problems on a 3-element set
cites work: The Complexity of the Counting Constraint Satisfaction Problem
cites work: Classifying the Complexity of Constraints Using Finite Algebras
cites work: On counting homomorphisms to directed acyclic graphs
cites work: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
cites work: On the parameterized complexity of multiple-interval graph problems
cites work: Structural tractability of enumerating CSP solutions
cites work: The complexity of homomorphism and constraint satisfaction problems seen from the other side
cites work: The core of a graph
cites work: On the complexity of H-coloring
cites work: Efficient Planarity Testing
cites work: On generating all maximal independent sets
cites work: The Approximability of Three-valued MAX CSP
cites work: Maximum \(H\)-colourable subdigraphs and constraint optimization with arbitrary weights
cites work: Tractable hypergraph properties for constraint satisfaction and conjunctive queries
cites work: Q3549708
cites work: Uniform Constraint Satisfaction Problems and Database Theory
cites work: Enumerating All Solutions for Constraint Satisfaction Problems
DOI: 10.1016/J.JCSS.2011.09.006
description: scientific article; zbMATH DE number 6033516