Inicio > Matemáticas y ciencia > Matemáticas > Computational Complexity of Counting and Sampling
Computational Complexity of Counting and Sampling

Computational Complexity of Counting and Sampling

Istvan Miklos

170,13 €
IVA incluido
Disponible
Editorial:
Taylor & Francis Ltd
Año de edición:
2019
Materia
Matemáticas
ISBN:
9781138035577
170,13 €
IVA incluido
Disponible

Selecciona una librería:

  • Librería Samer Atenea
  • Librería Aciertas (Toledo)
  • Kálamo Books
  • Librería Perelló (Valencia)
  • Librería Elías (Asturias)
  • Donde los libros
  • Librería Kolima (Madrid)
  • Librería Proteo (Málaga)
Sobre IBD

The purpose of the book is to give a comprehensive and detailed introduction to the computational complexity of counting and sampling. The book consists of three main topics: I. Counting problems that are solvable in polynomial running time, II. Approximation algorithms for counting and sampling, III. Holographic algorithms.

Artículos relacionados

  • Wearable Electronics and Embedded Computing Systems for Biomedical Applications
    Wearable electronics and embedded computing systems have been receiving a great deal of interest over the last two decades in research and commercial fields, with a special focus on biomedical applications. The key benefits introduced by these systems include their small size, lightweight, low-power consumption, and, of course, wearability. Major human-centered applications are...
    Disponible

    67,84 €

  • John and Betty’s Journey Into Complex Numbers
    Matt Bower
    Set in the genre of a children’s book, John and Betty trace the evolutionof complex numbers and explore their operations. From integers, tofractions, to surds, complex numbers are made to seem like an obviousextension. Incorporating graphing on the complex number plane andculminating in De Moivre’s Theorem, the logic of complex numbers ismade to seem intuitive and simple. John ...
    Disponible

    19,23 €

  • Special Functions
    Historically, the notion of entropy emerged in conceptually very distinct contexts. This book deals with the connection between entropy, probability, and fractional dynamics as they appeared, for example, in solar neutrino astrophysics since the 1970's (Mathai and Rathie 1975, Mathai and Pederzoli 1977, Mathai and Saxena 1978, Mathai, Saxena, and Haubold 2010).The original ...
    Disponible

    75,85 €

  • VALUE DISTRIBUTION IN P-ADIC ANALYSIS
    ALAIN ESCASSUT / ESCASSUT ALAIN
     The book first explains the main properties of analytic functions in order to use them in the study of various problems in p-adic value distribution. Certain properties of p-adic transcendental numbers are examined such as order and type of transcendence, with problems on p-adic exponentials. Lazard's problem for analytic functions inside a disk is explained. P-adic meromo...
  • WORLDWIDE LOTTERY GAMES In Naturally Optimized Systems
    Cornelia Lala / Corneliu Lala
    Worldwide Lottery Games In Naturally Optimized Systems Pick 5 has been developed on the authors’ initiative, based on the belief that nothing in the Universe happens by chance because there are laws governing everything, and by increasing our knowledge, we can triumph over mere chance. This is a book for players and/or groups of players (syndicates) who want to play to more th...
    Disponible

    28,34 €

  • ENTENDIENDO LAS PROBABILIDADES Y CALCULÁNDOLAS
    Catalin Barboianu / Rafael Martilotti
    La vida cotidiana está llena de situaciones que exigen tomar decisiones. Y en estos casos comparamos y hacemos estimaciones de probabilidades, a veces casi sin darnos cuenta, especialmente en el momento de decidir. Pero las probabilidades no son números simples asociados objetiva o subjetivamente a los eventos, como nos podría parecer, y el cálculo y el uso que le damos están e...
    Disponible

    31,57 €

Otros libros del autor

  • Computational Complexity of Counting and Sampling
    Istvan Miklos
    The purpose of the book is to give a comprehensive and detailed introduction to the computational complexity of counting and sampling. The book consists of three main topics: I. Counting problems that are solvable in polynomial running time, II. Approximation algorithms for counting and sampling, III. Holographic algorithms. ...