Diagonalizing over Deterministic Polynomial Time.
Klaus Ambos-SpiesHans FleischhackHagen HuwigPublished in: CSL (1987)
Keyphrases
- deterministic domains
- decomposable negation normal form
- special case
- computational complexity
- randomized algorithms
- turing machine
- randomized algorithm
- relaxation algorithm
- real world
- deterministic automata
- worst case
- approximation algorithms
- black box
- approximation ratio
- planning problems
- artificial neural networks
- symbolic model checking
- stochastic domains
- objective function
- multiscale
- data sets