On the Hamming distance of constraint satisfaction problems.
type: Item
instance of: scholarly article
title: On the Hamming distance of constraint satisfaction problems.
zbMATH Open document ID: 1061.68070
DOI: 10.1016/S0304-3975(01)00146-3
author: Pilu Crescenzi
author: Gianluca Rossi
published in: Theoretical Computer Science
publication date: 2003-01-21T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 1857049
zbMATH Keywords: Satisfiability
zbMATH Keywords: Computational complexity
zbMATH Keywords: Approximation algorithms
MaRDI profile type: Publication
cites work: Q4258216
cites work: Q4039803
cites work: Q4293543
cites work: The complexity of theorem-proving procedures
cites work: Completeness in approximation classes
cites work: Q3789107
cites work: The approximability of constraint satisfaction problems
cites work: Q4526965
cites work: Q4856179
cites work: Q3221403
cites work: Optimization, approximation, and complexity classes
cites work: The complexity of satisfiability problems
description: scientific article; zbMATH DE number 1857049