Periodic constraint satisfaction problems: Tractable subclasses
type: Item
instance of: scholarly article
title: Periodic constraint satisfaction problems: Tractable subclasses
zbMATH Open document ID: 1084.68120
author: Hubie Chen
published in: Constraints
publication date: 2006-02-23T00:00:00Z
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 5009055
zbMATH Keywords: periodic problems
zbMATH Keywords: polynomial-time algorithms
MaRDI profile type: Publication
full work available at URL: s10601-005-0551-z
OpenAlex ID: W2038688206
cites work: Q2754150
cites work: The complexity of maximal constraint languages
cites work: Characterising tractable constraints
cites work: Complexity classifications of Boolean constraint satisfaction problems
cites work: Q4495111
cites work: A new tractable class of constraint satisfaction problems
cites work: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
cites work: Q4542577
cites work: Q3140457
cites work: On the algebraic structure of combinatorial problems
cites work: Constraints, consistency and closure
cites work: Constraints and universal algebra
cites work: Closure properties of constraints
cites work: Q4258576
cites work: Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems
cites work: The complexity of satisfiability problems
DOI: 10.1007/S10601-005-0551-Z
description: scientific article; zbMATH DE number 5009055