Login / Signup

Reducing the worst case running times of a family of RNA and CFG problems, using Valiant's approach.

Shay ZakovDekel TsurMichal Ziv-Ukelson
Published in: Algorithms Mol. Biol. (2011)
Keyphrases
  • running times
  • worst case
  • times faster
  • lower bound
  • optimization problems
  • computational complexity
  • upper bound
  • data sets
  • objective function
  • error bounds
  • computational learning theory