Finding most likely solutions

DOI10.1007/s00224-009-9179-5zbMath1185.68650OpenAlexW2001046146MaRDI QIDQ733750

Mikael Onsjö, Osamu Watanabe

Publication date: 19 October 2009

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-009-9179-5

zbMATH Keywords

average-case analysismessage passing algorithmplanted solution modelmost-likely solution

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Cites Work

• Unnamed Item
• Unnamed Item
• The Metropolis algorithm for graph bisection
• A spectral heuristic for bisecting random graphs
• Improved low-density parity-check codes using irregular graphs
• Good error-correcting codes based on very sparse matrices
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• A Simple Message Passing Algorithm for Graph Partitioning Problems
• Average-Case Analysis for the MAX-2SAT Problem

This page was built for publication: Finding most likely solutions