Optimal 2-constraint satisfaction via sum--product algorithms

Authors:
Mikko Koivisto
Affiliations:
HIIT Basic Research Unit, Department of Computer Science, University of Helsinki, Finland
Venue:
Information Processing Letters
Year:
2006

Citing 10
Cited 2

Matrix multiplication via arithmetic progressions

Journal of Symbolic Computation - Special issue on computational algebraic complexity
Introduction to algorithms

Introduction to algorithms
A simplified NP-complete MAXSAT problem

Information Processing Letters
Bucket elimination: a unifying framework for reasoning

Artificial Intelligence
Faster exact algorithms for hard problems: a parameterized point of view

Discrete Mathematics
An Algebraic Model for Combinatorial Problems

SIAM Journal on Computing
Exact algorithms for NP-hard problems: a survey

Combinatorial optimization - Eureka, you shrink!
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT

Discrete Applied Mathematics - The renesse issue on satisfiability
A new algorithm for optimal 2-constraint satisfaction and its implications

Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Factor graphs and the sum-product algorithm

IEEE Transactions on Information Theory

A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between

Journal of Computer and System Sciences
Exact exponential algorithms

Communications of the ACM

Quantified Score

Hi-index	0.91

Visualization

Abstract

We show that for a given set of m pairwise constraints over n variables, a variable assignment that satisfies maximally many m constraints (MAX-2-CSP) can be found in O^*(nmd^n^@w^/^3) time, where d is the maximum number of states per variable, and @w