We discuss a categorical version of the celebrated belief propagation algorithm. This provides a way to prove that some algorithms which are known or suspected to be analogous, are actually identical when formulated generically. It also highlights the computational point of view in monoidal categories.
|Original language||English (US)|
|Number of pages||8|
|Journal||Electronic Proceedings in Theoretical Computer Science, EPTCS|
|State||Published - Dec 28 2014|
|Event||11th Workshop on Quantum Physics and Logic, QPL 2014 - Kyoto, Japan|
Duration: Jun 4 2014 → Jun 6 2014
All Science Journal Classification (ASJC) codes