Relatively quantified constraint satisfaction
type: Item
instance of: scholarly article
title: Relatively quantified constraint satisfaction
zbMATH Open document ID: 1191.68625
author: Manuel Bodirsky
author: Hubie Chen
published in: Constraints
publication date: 2009-05-29T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 5559835
zbMATH Keywords: quantified constraint satisfaction
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: s10601-008-9054-z
OpenAlex ID: W2012141606
cites work: Computer Science Logic
cites work: A dichotomy theorem for constraint satisfaction problems on a 3-element set
cites work: A Simple Algorithm for Mal'tsev Constraints
cites work: Algorithmic Learning Theory
cites work: Q2754150
cites work: STACS 2005
cites work: Complexity classifications of Boolean constraint satisfaction problems
cites work: Q4495111
cites work: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
cites work: On the algebraic structure of combinatorial problems
cites work: Constraints, consistency and closure
cites work: Closure properties of constraints
cites work: Q3365840
cites work: The complexity of satisfiability problems
DOI: 10.1007/S10601-008-9054-Z
description: scientific article; zbMATH DE number 5559835