Articles liés à Akra-Bazzi Method: Computer science, Recurrence, Divide...

Akra-Bazzi Method: Computer science, Recurrence, Divide and conquer algorithm, Algorithm, Master theorem, Big O notation, Floor and ceiling functions - Couverture souple

 
9786132584571: Akra-Bazzi Method: Computer science, Recurrence, Divide and conquer algorithm, Algorithm, Master theorem, Big O notation, Floor and ceiling functions
Couverture souple
ISBN 10 : 6132584579 ISBN 13 : 9786132584571
Editeur : OmniScriptum, 2010

Synopsis

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computer science, the Akra–Bazzi method, or Akra– Bazzi theorem, is used to analyze the asymptotic behavior of the mathematical recurrences that appear in the analysis of divide and conquer algorithms where the sub-problems have substantially different sizes. It is a generalization of the well-known master theorem, which assumes that the sub-problems have equal size.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Reseña del editor

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computer science, the Akra–Bazzi method, or Akra– Bazzi theorem, is used to analyze the asymptotic behavior of the mathematical recurrences that appear in the analysis of divide and conquer algorithms where the sub-problems have substantially different sizes. It is a generalization of the well-known master theorem, which assumes that the sub-problems have equal size.

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Éditeur
OmniScriptum
Date d'édition
2010
Langue
anglais
ISBN 10 
6132584579
ISBN 13 
9786132584571
Reliure
Tapa blanda
Nombre de pages
80
Éditeur
Miller Frederic P., Vandome Agnes F., McBrewster John
Coordonnées du fabricant
non disponible
Personne responsable
non disponible