Optimal 2-constraint satisfaction via sum-product algorithms
type: Item
instance of: scholarly article
title: Optimal 2-constraint satisfaction via sum-product algorithms
zbMATH Open document ID: 1186.68439
author: Mikko Koivisto
published in: Information Processing Letters
publication date: 2010-01-18T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5659897
zbMATH Keywords: algorithms
zbMATH Keywords: computational complexity
zbMATH Keywords: matrix multiplication
zbMATH Keywords: maximum satisfiability
zbMATH Keywords: sum-product
describes a project that uses: MAX-2-SAT
MaRDI profile type: Publication
full work available at URL: j.ipl.2005.11.013
OpenAlex ID: W2168696918
cites work: Faster exact algorithms for hard problems: A parameterized point of view
cites work: Matrix multiplication via arithmetic progressions
cites work: Q3619797
cites work: Bucket elimination: A unifying framework for reasoning
cites work: Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT.
cites work: Factor graphs and the sum-product algorithm
cites work: A simplified NP-complete MAXSAT problem
cites work: Fast multiplication of large numbers
cites work: An Algebraic Model for Combinatorial Problems
cites work: A new algorithm for optimal 2-constraint satisfaction and its implications
cites work: Q4414647
DOI: 10.1016/J.IPL.2005.11.013
description: scientific article; zbMATH DE number 5659897