Computational Complexity of Counting and Sampling - Couverture souple

Livre 51 sur 67: Discrete Mathematics and Its Applications

Miklos, Istvan

 
9781138035577: Computational Complexity of Counting and Sampling
Couverture souple
ISBN 10 : 1138035572 ISBN 13 : 9781138035577
Editeur : Routledge, 2019

Synopsis

Computational Complexity of Counting and Sampling provides readers with comprehensive and detailed coverage of the subject of computational complexity. It is primarily geared toward researchers in enumerative combinatorics, discrete mathematics, and theoretical computer science.

The book covers the following topics: Counting and sampling problems that are solvable in polynomial running time, including holographic algorithms; #P-complete counting problems; and approximation algorithms for counting and sampling.

First, it opens with the basics, such as the theoretical computer science background and dynamic programming algorithms. Later, the book expands its scope to focus on advanced topics, like stochastic approximations of counting discrete mathematical objects and holographic algorithms. After finishing the book, readers will agree that the subject is well covered, as the book starts with the basics and gradually explores the more complex aspects of the topic.

Features:

  • Each chapter includes exercises and solutions

  • Ideally written for researchers and scientists

    • Covers all aspects of the topic, beginning with a solid introduction, before shifting to computational complexity’s more advanced features, with a focus on counting and sampling

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

    À propos de l'auteur

    István Miklós is a Hungarian mathematician and bioinformatician at the Rényi Institute in Budapest. He holds a Ph.D. from Eotvos University in Budapest. His research interests lie in theoretical and applied computer science and combinatorics, particularly in the study of Markov chain, Monte Carlo methods and in sampling and counting combinatorial objects appearing in applied mathematics. He has more than 50 peer-reviewed scientific papers.

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

    Éditeur
    Routledge
    Date d'édition
    2019
    Langue
    anglais
    ISBN 10 
    1138035572
    ISBN 13 
    9781138035577
    Reliure
    Broché
    Nombre de pages
    390
    Coordonnées du fabricant
    non disponible
    Personne responsable
    GPSR Kontakt
    gpsr@libri.de

    Europaallee 1
    Bad Hersfeld
    36244
    Allemagne

    Autres éditions populaires du même titre

    9781138070837: Computational Complexity of Counting and Sampling

    Edition présentée

    ISBN 10 :  1138070831 ISBN 13 :  9781138070837
    Editeur : CRC Press, 2019
    Couverture rigide