Aguarde...
 

PARADIGMS FOR FAST PARALLEL APPROXIMABILITY


    R$ 471,30

    em até 10x de R$ 47,13 sem juros no cartão, ver mais opções
    Produto sob encomenda
    Previsão: 6 Semanas + Frete

     
    Frete grátis para compras acima de:
    Sul e Sudeste: R$ 99,00
    Centro-Oeste e Nordeste: R$ 109,00
    Norte: R$ 139,00
    Confira o regulamento

    Calcule prazo de entrega e frete:

     - 

    Sinopse

    Various problems in computer science are 'hard', that is NP-complete, and so not realistically computable; thus in order to solve them they have to be approximated. This book is a survey of the basic techniques for approximating combinatorial problems using parallel algorithms. Its core is a collection of techniques that can be used to provide parallel approximations for a wide range of problems (for example, flows, coverings, matchings, travelling salesman problems, graphs), but in order to make the book reasonably self-contained, the authors provide an introductory chapter containing the basic definitions and results. A final chapter deals with problems that cannot be approximated, and the book is ended by an appendix that gives a convenient summary of the problems described in the book.This will be a up-to-date reference for research workers in the area of algorithms, but it can also be used for graduate courses in the subject.

    Detalhes do Produto

    Avaliação dos Consumidores

    ROLAR PARA O TOPO