ISBN: 9781332869916 - balancing is not always good (classic reprint) (4 risultati)

Perfeziona la tua ricerca

  • Libri (4)

  • Nuovo (4)

a

Fascia di prezzo personalizzata (EUR)

a

  • Lingua: Inglese

    Editore: Forgotten Books, 2018

    1332869912 / 9781332869916

    • Brossura

    Da: PBShop.store US, Wood Dale, IL, U.S.A.PBShop.store US

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 25,22

     Spedizione gratuita 
    Spedito in U.S.A.

    Quantità: 15 disponibili

    PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

  • Lingua: Inglese

    Editore: Forgotten Books, 2018

    1332869912 / 9781332869916

    • Brossura

    Da: PBShop.store UK, Fairford, GLOS, Regno UnitoPBShop.store UK

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 24,71

    EUR 3,93 spedizione 
    Spedito da Regno Unito a U.S.A.

    Quantità: 15 disponibili

    PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

  • Altre immagini

    Lingua: Inglese

    Editore: Forgotten Books, London, 2018

    1332869912 / 9781332869916

    • Brossura
    • Print on Demand

    Da: Forgotten Books, London, Regno UnitoForgotten Books

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 16,06

     Spedizione gratuita 
    Spedito da Regno Unito a U.S.A.

    Quantità: Più di 20 disponibili

    Paperback. Condizione: New. No Jacket. Print on Demand. Optimal splitting and tree structure shape algorithm performance. This book introduces practical tools for analyzing how recurrences describe the running time of divide-and-conquer algorithms. It connects differences, convexity, and concavity to the way work is distributed as n grows, and shows how to frame these ideas with binary trees.Two clear sections frame the value: first, a set of theorems that describe when simple, balanced structures minimize cost; and second, a deeper look at how different tree shapes-balanced or heap-like-affect the f-sum and the overall solution to core recurrence relations. Throughout, the text stays focused on concrete results and their implications for algorithm design.Learn how first- and second-order differences relate to monotonicity, convexity, and cost.See how balanced and heap trees influence minimal f-sum in recurrences.Explore when the optimal strategy is to split evenly versus becoming more unbalanced.Understand error estimates that compare rational-domain solutions to integer-domain recurrences.Ideal for readers of advanced algorithms, discrete math, and performance analysis who want a rigorous, application-oriented treatment of recurrence relations and tree-based costs. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item.…

  • Lingua: Inglese

    Editore: Forgotten Books, 2018

    1332869912 / 9781332869916

    • Brossura
    • Print on Demand

    Da: Revaluation Books, Exeter, Regno UnitoRevaluation Books

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 34,13

    EUR 11,93 spedizione 
    Spedito da Regno Unito a U.S.A.

    Quantità: 1 disponibile

    Paperback. Condizione: Brand New. 30 pages. 9.21x5.98x0.10 inches. This item is printed on demand.