Bokus

Nisheeth K. Vishnoi – författare

Visar alla böcker från författaren Nisheeth K. Vishnoi. Handla med fri frakt och snabb leverans.

4 produkter

  1. Nisheeth K. Vishnoi - Algorithms for Convex Optimization, Inbunden. Tillgänglighet: Lägg i varukorg

    Algorithms for Convex Optimization

    Av Nisheeth K. Vishnoi

    Inbunden, 2021

    1432 kr

    Lägg i varukorg

    In the last few years, Algorithms for Convex Optimization have revolutionized algorithm design, both for discrete and continuous optimization problems. For problems like maximum flow, maximum matching, and submodular function minimization, the fastest algorithms involve essential methods such as …

  2. Nisheeth K. Vishnoi - Algorithms for Convex Optimization, E-bok. Tillgänglighet: Lägg i varukorg

    Algorithms for Convex Optimization

    Av Nisheeth K. Vishnoi

    E-bok, 2021

    605 kr

    Lägg i varukorg

    In the last few years, Algorithms for Convex Optimization have revolutionized algorithm design, both for discrete and continuous optimization problems. For problems like maximum flow, maximum matching, and submodular function minimization, the fastest algorithms involve essential methods such as …

  3. Nisheeth K. Vishnoi - Algorithms for Convex Optimization, Häftad. Tillgänglighet: Lägg i varukorg

    Algorithms for Convex Optimization

    Av Nisheeth K. Vishnoi

    Häftad, 2021

    601 kr

    Lägg i varukorg

    In the last few years, Algorithms for Convex Optimization have revolutionized algorithm design, both for discrete and continuous optimization problems. For problems like maximum flow, maximum matching, and submodular function minimization, the fastest algorithms involve essential methods such as …

  4. Nisheeth K. Vishnoi - Algorithms for Convex Optimization, E-bok. Tillgänglighet: Lägg i varukorg

    Algorithms for Convex Optimization

    Av Nisheeth K. Vishnoi

    E-bok, 2021

    605 kr

    Lägg i varukorg

    In the last few years, Algorithms for Convex Optimization have revolutionized algorithm design, both for discrete and continuous optimization problems. For problems like maximum flow, maximum matching, and submodular function minimization, the fastest algorithms involve essential methods such as …