Vi bøger
Trustpilot
Levering: 1 - 2 hverdage
Hjælp
Login
  1. Forside
  2. Bøger
  3. Business og læring
  4. Computer og IT
  5. Computational Complexity of Counting and Sampling

Computational Complexity of Counting and Sampling - Istvan (Renyi Institute Miklos - Bog

af Istvan (Renyi Institute Miklos

indgår i Discrete Mathematics and Its Applications serien

Computational Complexity of Counting and Sampling af Istvan (Renyi Institute Miklos
Bag om Computational Complexity of Counting and Sampling

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.

Vis mere
  • Sprog:
  • Engelsk
  • ISBN:
  • 9781138035577
  • Indbinding:
  • Paperback
  • Sideantal:
  • 408
  • Udgivet:
  • 20. Februar 2019
  • Størrelse:
  • 233x158x23 mm.
  • Vægt:
  • 600 g.
  • 2-3 uger.
  • 20. Juli 2024
På lager

Normalpris

Medlemspris

Prøv i 30 dage for 45 kr.
Herefter fra 79 kr./md. Ingen binding.

Bag om Istvan (Renyi Institute Miklos

Vis alle bøger af Istvan (Renyi Institute Miklos

Beskrivelse af Computational Complexity of Counting and Sampling

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.

Brugerbedømmelser af Computational Complexity of Counting and Sampling



Andre købte også..
Find lignende bøger
Bogen Computational Complexity of Counting and Sampling findes i følgende kategorier:

Gør som tusindvis af andre bogelskere

Tilmeld dig nyhedsbrevet og få gode tilbud og inspiration til din næste læsning.