2 citations · 4 across the 3 of their papers we have counts for
1 paper · 1 filter
Michel Feldmann
In a previous paper, we have shown that any Boolean formula can be encoded as a linear programming problem in the framework of Bayesian probability theory. When applied to NP-compl…