ProV Logo
0

Solving satisfiability by Bayesian infer...
Feldmann, Michel...
Solving satisfiability by Bayesian inference by Feldmann, Michel ( Author )
Australian National University
11-08-2023
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 solving the 3-SAT problem in polynomial time. Beyond this, Bayesian inference could be the background of artificial neural network theory.
-
Article
pdf
30.00 KB
English
-
MYR 0.01
-
http://arxiv.org/abs/1205.6658
Share this eBook