An Explicit Separation of Relativised Random Polynomial Time and Relativised Deterministic Polynomial Time.
Richard ZippelPublished in: Inf. Process. Lett. (1989)
Keyphrases
- approximation algorithms
- special case
- computational complexity
- neural network
- decomposable negation normal form
- turing machine
- machine learning
- np hardness
- database
- worst case
- data sets
- bayesian networks
- genetic algorithm
- approximation ratio
- dnf formulas
- randomized algorithm
- real world
- polynomial hierarchy
- complexity theoretic