On the complexity of MMSNP
type: Item
instance of: scholarly article
zbMATH Open document ID: 1280.68106
DOI: 10.1137/090778493
author: Manuel Bodirsky
author: Hubie Chen
author: Tomás Feder
published in: SIAM Journal on Discrete Mathematics
publication date: 2012-08-22T00:00:00Z
Mathematics Subject Classification ID: 68Q19
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6070047
zbMATH Keywords: constraint satisfaction problems
zbMATH Keywords: existential second-order logic
zbMATH Keywords: computational complexity
zbMATH Keywords: complexity dichotomy
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1137/090778493
OpenAlex ID: W2086423722
Recommended article: Q4796705
Recommended article: The complexity of the single individual SNP haplotyping problem
Recommended article: On the Complexity of RSRL
Recommended article: Q4736838
Recommended article: Q5111137
Recommended article: The Worst Case Complexity of Maximum Parsimony
Recommended article: On parameterized complexity of the multi-MCS problem
Recommended article: Q3613100
Recommended article: The Complexity of Translating BLPs to RMMs
Recommended article: On the Complexity of Master Problems
title: On the complexity of MMSNP
description: scientific article; zbMATH DE number 6070047