Paper Info
Title
First-Order Bayesian Network Specifications Capture the Complexity Class PP.
Abstract
The point of this note is to prove that a language is in the complexity class PP if and only if the strings of the language encode valid inferences in a Bayesian network defined using function-free first-order logic with equality.
Year
Venue
Field
2016
arXiv: Artificial Intelligence
Complexity class,ENCODE,Sparse language,First order,Computer science,Bayesian network,If and only if,Artificial intelligence,Machine learning
DocType
Volume
Citations 
Journal
abs/1609.03437
0
PageRank 
References 
Authors
0.34
0
1
Name
Order
Citations
PageRank
Fábio Cozman11810.16