Login / Signup
Optimal Inapproximability with Universal Factor Graphs.
Per Austrin
Jonah Brown-Cohen
Johan Håstad
Published in:
SODA (2021)
Keyphrases
</>
factor graphs
message passing
dynamic programming
optimal solution
worst case
distributed systems
high quality
special case
belief propagation
latent variables
approximation algorithms