Lower Bounds on Message Passing Implementations of Multiplicity-Relaxed Queues and Stacks.
Edward TalmagePublished in: SIROCCO (2022)
Keyphrases
- message passing
- lower bound
- matrix multiplication
- optimal solution
- belief propagation
- upper bound
- distributed systems
- probabilistic inference
- branch and bound algorithm
- branch and bound
- objective function
- shared memory
- inference in graphical models
- graphical models
- factor graphs
- np hard
- lower and upper bounds
- sum product
- distributed shared memory
- lagrangian relaxation
- sum product algorithm
- markov random field
- matching algorithm
- multi view
- linear programming relaxation
- ldpc codes