Login / Signup

Restricted Relativizations of Probablistic Polynomial Time.

Seinosuke Toda
Published in: Theor. Comput. Sci. (1992)
Keyphrases
  • special case
  • approximation algorithms
  • computational complexity
  • worst case
  • data sets
  • genetic algorithm
  • digital libraries
  • hidden markov models
  • upper bound
  • finite automata
  • np hardness
  • bounded treewidth