An Higher-Order Characterization of Probabilistic Polynomial Time (Long Version)
Ugo Dal LagoPaolo Parisen ToldinPublished in: CoRR (2012)
Keyphrases
- higher order
- deterministic finite state automata
- high order
- pairwise
- special case
- natural images
- probabilistic model
- bayesian networks
- lambda calculus
- data driven
- worst case
- generative model
- graphical models
- probabilistic approaches
- long sequences
- finite automata
- np complete
- databases
- computational complexity
- information retrieval
- neural network