Classifying the Complexity of Constraints Using Finite Algebras
type: Item
instance of: scholarly article
title: Classifying the Complexity of Constraints Using Finite Algebras
zbMATH Open document ID: 1071.08002
DOI: 10.1137/S0097539700376676
author: Andrei A. Bulatov
author: Andrei Krokhin
author: P. Jeavons
published in: SIAM Journal on Computing
publication date: 2005-09-16T00:00:00Z
Mathematics Subject Classification ID: 08A70
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 2205867
zbMATH Keywords: constraint satisfaction problem
zbMATH Keywords: universal algebra
zbMATH Keywords: dichotomy theorem
zbMATH Keywords: computational complexity
zbMATH Keywords: tractable algebra
zbMATH Keywords: tractability
zbMATH Keywords: search problem
MaRDI profile type: Publication
full work available at URL: s0097539700376676
OpenAlex ID: W2026753685
description: scientific article; zbMATH DE number 2205867