0

Meu carrinho

    Favoritar
    PARAMATERIZED COMPLEXITY THEORY
    Ref:
    629058

    Por: R$ 1.075,89ou X de

    Comprar

    Sinopse

    Parameterized complexity theory is a recent branch of computational complexity theory that provides a framework for a refined analysis of hard algorithmic problems. The central notion of the theory, fixed-parameter tractability, has led to the development of various new algorithmic techniques and a whole new theory of intractability. This book is a state-of-the-art introduction to both algorithmic techniques for fixed-parameter tractability and the structural theory of parameterized complexity classes, and it presents detailed proofs of recent advanced results that have not appeared in book form before. Several chapters are each devoted to intractability, algorithmic techniques for designing fixed-parameter tractable algorithms, and bounded fixed-parameter tractability and subexponential time complexity. The treatment is comprehensive, and the reader is supported with exercises, notes, a detailed index, and some background on complexity theory and logic.
    Mostrar mais

    Ficha técnica

    Especificações

    ISBN9783540299523
    Pré vendaNão
    Peso550g
    Livro disponível - pronta entregaNão
    Tipo itemLivro Importado
    Número de páginas493
    Número da edição1ª EDIÇÃO - 2006
    Código Interno629058
    Código de barras9783540299523
    AcabamentoHARDCOVER
    AutorFLUM, JORG | GROHE, M.
    EditoraSPRINGER VERLAG
    Sob encomendaSim

    Este livro é vendido

    SOB ENCOMENDA

    SE DISPONÍVEL NO FORNECEDOR SERÁ ENTREGUE EM dias

    Mais

    O prazo de acordo com a transportadora selecionada.

    Comprar