Greedy can also beat pure dynamic programming - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Stasys Jukna, Hannes Seiwert. Greedy can also beat pure dynamic programming. Electronic Colloquium on Computational Complexity (ECCC), 25:49, 2018. [doi]

@article{JuknaS18,
  title = {Greedy can also beat pure dynamic programming},
  author = {Stasys Jukna and Hannes Seiwert},
  year = {2018},
  url = {https://eccc.weizmann.ac.il/report/2018/049},
  researchr = {https://researchr.org/publication/JuknaS18},
  cites = {0},
  citedby = {0},
  journal = {Electronic Colloquium on Computational Complexity (ECCC)},
  volume = {25},
  pages = {49},
}

runs on WebDSL