12 citations · 25 across the 12 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.DS2012★ 2 cited
Polynomial time factoring algorithm using Bayesian arithmetic
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…
cs.CC2012★ 3 cited
Solving satisfiability by Bayesian inference
Michel Feldmann
We demonstrate that any logical problem can be solved by Bayesian inference. In this approach, the distinction between complexity classes vanishes. The method is illustrated by sol…