Reduced Error Pruning of branching programs cannot be approximated to within a logarithmic factor

Richard Nock, Tapio Elomaa, Matti Kääriäinen. Reduced Error Pruning of branching programs cannot be approximated to within a logarithmic factor. Inf. Process. Lett., 87(2):73-78, 2003. [doi]

@article{NockEK03,
  title = {Reduced Error Pruning of branching programs cannot be approximated to within a logarithmic factor},
  author = {Richard Nock and Tapio Elomaa and Matti Kääriäinen},
  year = {2003},
  doi = {10.1016/S0020-0190(03)00255-2},
  url = {http://dx.doi.org/10.1016/S0020-0190(03)00255-2},
  researchr = {https://researchr.org/publication/NockEK03},
  cites = {0},
  citedby = {0},
  journal = {Inf. Process. Lett.},
  volume = {87},
  number = {2},
  pages = {73-78},
}