Efficiently Approximating Weighted Sums with Exponentially Many Terms

Cite

Text

Chawla et al. "Efficiently Approximating Weighted Sums with Exponentially Many Terms." Annual Conference on Computational Learning Theory, 2001. doi:10.1007/3-540-44581-1_6

Markdown

[Chawla et al. "Efficiently Approximating Weighted Sums with Exponentially Many Terms." Annual Conference on Computational Learning Theory, 2001.](https://mlanthology.org/colt/2001/chawla2001colt-efficiently/) doi:10.1007/3-540-44581-1_6

BibTeX

@inproceedings{chawla2001colt-efficiently,
  title     = {{Efficiently Approximating Weighted Sums with Exponentially Many Terms}},
  author    = {Chawla, Deepak and Li, Lin and Scott, Stephen},
  booktitle = {Annual Conference on Computational Learning Theory},
  year      = {2001},
  pages     = {82-98},
  doi       = {10.1007/3-540-44581-1_6},
  url       = {https://mlanthology.org/colt/2001/chawla2001colt-efficiently/}
}