Cálculo da Complexidade Exata de Algoritmos do tipo Divisão-e-Conquista via Maple

Authors

  • A.B. Loreto
  • L.V. Toscani
  • M.P. Fachin
  • M.M. Negrón

DOI:

https://doi.org/10.5540/tema.2001.02.01.0125

Abstract

A equação de complexidade de um algoritmo recursivo pode ser expressa em termos de uma equação de recorrência.

Downloads

Published

2001-06-01

How to Cite

Loreto, A., Toscani, L., Fachin, M., & Negrón, M. (2001). Cálculo da Complexidade Exata de Algoritmos do tipo Divisão-e-Conquista via Maple. Trends in Computational and Applied Mathematics, 2(1), 125–134. https://doi.org/10.5540/tema.2001.02.01.0125

Issue

Vol. 2 No. 1 (2001)

Section

Original Article

License

Copyright

Authors of articles published in the journal Trends in Computational and Applied Mathematics retain the copyright of their work. The journal uses Creative Commons Attribution (CC-BY) in published articles. The authors grant the TCAM journal the right to first publish the article.

Intellectual Property and Terms of Use

The content of the articles is the exclusive responsibility of the authors. The journal uses Creative Commons Attribution (CC-BY) in published articles. This license allows published articles to be reused without permission for any purpose as long as the original work is correctly cited.

The journal encourages Authors to self-archive their accepted manuscripts, publishing them on personal blogs, institutional repositories, and social media, as long as the full citation is included in the journal's website version.