Constraint satisfaction problems: convexity makes AllDifferent constraints tractable
type: Item
instance of: scholarly article
title: Constraint satisfaction problems: convexity makes AllDifferent constraints tractable
zbMATH Open document ID: 1257.68079
author: Michael R. Fellows
author: Tobias Friedrich
author: Danny Hermelin
author: Nina Narodytska
author: Frances Rosamond
published in: Theoretical Computer Science
publication date: 2013-03-04T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 6140783
zbMATH Keywords: constraint satisfaction problems
zbMATH Keywords: complexity
zbMATH Keywords: AllDiff constraints
zbMATH Keywords: convexity
zbMATH Keywords: fixed parameter tractability
Wikidata QID: Q57359604
MaRDI profile type: Publication
full work available at URL: j.tcs.2012.11.038
OpenAlex ID: W2042436180
DBLP publication ID: journals/tcs/FellowsFHNR13
DOI: 10.1016/J.TCS.2012.11.038
description: scientific article; zbMATH DE number 6140783