A Higher-Order Characterization of Probabilistic Polynomial Time.
Ugo Dal LagoPaolo Parisen ToldinPublished in: FOPARA (2011)
Keyphrases
- higher order
- deterministic finite state automata
- pairwise
- special case
- databases
- natural images
- markov models
- uncertain data
- high order
- computational complexity
- data driven
- generative model
- lower order
- markov random field
- worst case
- conditional random fields
- upper bound
- conditional probabilities
- context sensitive
- objective function
- low order
- lambda calculus
- case study