Tamaño medio de árboles simplificados
We have studied the average and the variance of the size of simplified trees obtained by simplifying a random tree, for both families of p-ary and general trees. But the most interesting fact in these paper is the methodology we have used, that in our opinion could be applied to the analysis of a br...
| Autor: | |
|---|---|
| Formato: | artículo |
| Fecha de publicación: | 1987 |
| País: | España |
| Recursos: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | español |
| OAI Identifier: | oai:upcommons.upc.edu:2099/3954 |
| Acesso em linha: | https://hdl.handle.net/2099/3954 |
| Access Level: | acceso abierto |
| Palavra-chave: | Complex Analysis Complexity Algorithms Ciències de la computació Teoria de la computació Classificació AMS::68 Computer science::68P Theory of data Classificació AMS::68 Computer science::68Q Theory of computing |
| Resumo: | We have studied the average and the variance of the size of simplified trees obtained by simplifying a random tree, for both families of p-ary and general trees. But the most interesting fact in these paper is the methodology we have used, that in our opinion could be applied to the analysis of a broad class of tree simplification algorithms. This methodology involves the study of Borne formal power series, and the application of the Darboux-Polya theorem to obtain asympthotic approximationsj as well as Borne other results from complex analysis. |
|---|