A higher-order characterization of probabilistic polynomial time.
Ugo Dal LagoPaolo Parisen ToldinPublished in: Inf. Comput. (2015)
Keyphrases
- higher order
- deterministic finite state automata
- probabilistic model
- natural images
- high order
- bayesian networks
- decision trees
- special case
- worst case
- lower order
- databases
- information retrieval
- data driven
- neural network
- genetic algorithm
- approximation algorithms
- uncertain data
- conditional probabilities
- relational databases
- multiscale
- social networks