SØG - mellem flere end 8 millioner bøger:

Søg på: Titel, forfatter, forlag - gerne i kombination.
Eller blot på isbn, hvis du kender dette.

Viser: Computational Complexity of Counting and Sampling

Computational Complexity of Counting and Sampling, 1. udgave
Søgbar e-bog

Computational Complexity of Counting and Sampling Vital Source e-bog

Istvan Miklos
(2019)
Taylor & Francis
1.230,00 kr.
Leveres umiddelbart efter køb
Computational Complexity of Counting and Sampling

Computational Complexity of Counting and Sampling

Istvan Miklos
(2019)
Sprog: Engelsk
CRC Press LLC
1.113,00 kr.
Denne bog er endnu ikke udgivet. Den forventes Feb 2019.

Detaljer om varen

  • 1. Udgave
  • Vital Source searchable e-book (Reflowable pages)
  • Udgiver: Taylor & Francis (Februar 2019)
  • ISBN: 9781351971607
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
Licens varighed:
Bookshelf online: 5 år fra købsdato.
Bookshelf appen: ubegrænset dage fra købsdato.

Udgiveren oplyser at følgende begrænsninger er gældende for dette produkt:
Print: 2 sider kan printes ad gangen
Copy: højest 2 sider i alt kan kopieres (copy/paste)

Detaljer om varen

  • Paperback: 390 sider
  • Udgiver: CRC Press LLC (Februar 2019)
  • ISBN: 9781138035577

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

The book covers three topics: Counting problems that are solvable in polynomial running time; Approximation of algorithms for counting and sampling; Holographic algorithms.

First, it opens with the basics such as the algorithmic point of view, dynamic programming algorithms and theoretical computer science point of view. Later, the book expands its scope to focus on advanced topics like stochastic approximations of counting computational 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
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
1. Background on computational complexity
2. Algebraic dynamic programming and monotone computations
3. Linear algebraic algorithms. The power of subtracting
4. #P-complete counting problems
5. Holographic algorithms
6. Methods of random generations
7. Mixing of Markov chains and their applications in the theory of counting and sampling
8. Approximable counting and sampling problems
De oplyste priser er inkl. moms

Polyteknisk Boghandel

har gennem mere end 50 år været studieboghandlen på DTU og en af Danmarks førende specialister i faglitteratur.

 

Vi lagerfører et bredt udvalg af bøger, ikke bare inden for videnskab og teknik, men også f.eks. ledelse, IT og meget andet.

Læs mere her


Trykt eller digital bog?

Ud over trykte bøger tilbyder vi tre forskellige typer af digitale bøger:

 

Vital Source Bookshelf: En velfungerende ebogsplatform, hvor bogen downloades til din computer og/eller mobile enhed.

 

Du skal bruge den gratis Bookshelf software til at læse læse bøgerne - der er indbygget gode værktøjer til f.eks. søgning, overstregning, notetagning mv. I langt de fleste tilfælde vil du samtidig have en sideløbende 1825 dages online adgang. Læs mere om Vital Source bøger

 

Levering: I forbindelse med købet opretter du et login. Når du har installeret Bookshelf softwaren, logger du blot ind og din bog downloades automatisk.

 

 

Adobe ebog: Dette er Adobe DRM ebøger som downloades til din lokale computer eller mobil enhed.

 

For at læse bøgerne kræves særlig software, som understøtter denne type. Softwaren er gratis, men du bør sikre at du har rettigheder til installere software på den maskine du påtænker at anvende den på. Læs mere om Adobe DRM bøger

 

Levering: Et download link sendes pr email umiddelbart efter købet.

 


Ibog: Dette er en online bog som kan læses på udgiverens website. 

Der kræves ikke særlig software, bogen læses i en almindelig browser.

 

Levering: Vores medarbejder sender dig en adgangsnøgle pr email.

 

Vi gør opmærksom på at der ikke er retur/fortrydelsesret på digitale varer.