Login / Signup
Probabilistic Polynomial Time is Closed under Parity Reductions.
Richard Beigel
Lane A. Hemachandra
Gerd Wechsung
Published in:
Inf. Process. Lett. (1991)
Keyphrases
</>
deterministic finite state automata
bayesian networks
generative model
real world
approximation algorithms
probabilistic logic
data sets
context sensitive
database
learning algorithm
special case
probabilistic model
worst case
belief networks