Optimal 2-constraint satisfaction via sum–product algorithms
- 15 April 2006
- journal article
- research article
- Published by Elsevier in Information Processing Letters
- Vol. 98 (1) , 24-28
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUTDiscrete Applied Mathematics, 2003
- Faster exact algorithms for hard problems: A parameterized point of viewDiscrete Mathematics, 2001
- Factor graphs and the sum-product algorithmIEEE Transactions on Information Theory, 2001
- Bucket elimination: A unifying framework for reasoningArtificial Intelligence, 1999
- A simplified NP-complete MAXSAT problemInformation Processing Letters, 1998
- An Algebraic Model for Combinatorial ProblemsSIAM Journal on Computing, 1996
- Matrix multiplication via arithmetic progressionsJournal of Symbolic Computation, 1990
- Schnelle Multiplikation großer ZahlenComputing, 1971