Skip to main content
Conference Proceedings

Lower bounds for divergence in the central limit theorem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2006) 4123 LNCS 578-594
DOI: 10.1007/11889342_35
1Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A method for finding asymptotic lower bounds on information divergence is developed and used to determine the rate of convergence in the Central Limit Theorem © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Harremoës, P. (2006). Lower bounds for divergence in the central limit theorem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4123 LNCS, pp. 578–594). https://doi.org/10.1007/11889342_35

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free