Computational Complexity of Counting and Sampling (Bog, Paperback / softback, Engelsk) af Istvan (Renyi Institute Miklos
  1. Forside
  2. Bøger
  3. Engelske bøger
  4. Kombinatorik og grafteori
  5. Algoritmer og datastrukturer
  6. Computational Complexity of Counting and Sampling

Computational Complexity of Counting and Sampling

(Bog, Paperback / softback, Engelsk)
Forfatter: Istvan (Renyi Institute Miklos
Computational Complexity of Counting and Sampling
Forlag: Taylor & Francis Ltd

Bemærk: Kan ikke leveres før jul.

Når du handler på WilliamDam.dk, betaler du den pris du ser.

  • Ingen gebyrer
  • Ingen abonnementer
  • Ingen bindingsperioder

Relaterede kategorier

Algoritmer og datastrukturer Kombinatorik og grafteori
  = Emner / kategorier
  = Sektioner / guides
  = Specialsider
  = Kampagner

Beskrivelse

The purpose of the book is to give a comprehensive and detailed introduction to the computationalcomplexity 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.

Læsernes anmeldelser (0)

Alle detaljer

Forlag Taylor & Francis Ltd
Forfatter Istvan (Renyi Institute Miklos
Type Bog
Format Paperback / softback
Sprog Engelsk
Udgivelsesdato 20-02-2019
Første udgivelsesår 2019
Serie Discrete Mathematics and Its Applications
Illustrationer 3 Tables, black and white; 34 Illustrations, black and white
Originalsprog United Kingdom
Sideantal 408
Indbinding Paperback / softback
Forlag Taylor & Francis Ltd
Sideoplysninger 408 pages, 3 Tables, black and white; 34 Illustrations, black and white
Mål 158 x 233 x 23
ISBN-13 / EAN-13 9781138035577