國立高雄大學圖資館 |

Language: English

Back

Computational complexity of counting and sampling

Record Type:	Electronic resources : Monograph/item
Title/Author:	Computational complexity of counting and samplingIstván Miklós.
Author:	Miklós, István.
Published:	Boca Raton, FL :CRC Press,c2019.
Description:	1 online resource.
Subject:	Computational complexity.
Online resource:	https://www.taylorfrancis.com/books/9781315266954
ISBN:	9781315266954$q(ebook)

Computational complexity of counting and sampling
Miklós, István.

Computational complexity of counting and sampling[electronic resource] /István Miklós. - Boca Raton, FL :CRC Press,c2019. - 1 online resource. - Discrete mathematics and its applications. - Discrete mathematics and its applications..

Includes bibliographical references and index.

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.

ISBN: 9781315266954$q(ebook)Subjects--Topical Terms:

185313
Computational complexity.

LC Class. No.: QA267.7

Dewey Class. No.: 511.3/52

Computational complexity of counting and sampling
LDR:02417cmm a2200361 a 4500 001 650241
003 FlBoTFG
005 20190403085220.0
006 m o d
007 cr cnu---unuuu
008 240227s2019 flu ob 001 0 eng d
020 $a 9781315266954$q(ebook)
020 $a 1315266954$q(ebook)
020 $a 9781351971614$q(ePDF)
020 $a 1351971611$q(ePDF)
020 $a 9781351971591$q(Mobipocket)
020 $a 135197159X$q(Mobipocket)
020 $a 9781351971607$q(epub)
020 $a 1351971603$q(epub)
020 $z 9781138035577$q(pbk.)
020 $z 9781138070837$q(hbk.)
035 $a 9781315266954
040 $a OCoLC-P $b eng $c OCoLC-P
041 0 $a eng
050 4 $a QA267.7
082 0 4 $a 511.3/52 $2 23
100 1 $a Miklós, István. $3 960215
245 1 0 $a Computational complexity of counting and sampling $h [electronic resource] / $c István Miklós.
260 $a Boca Raton, FL : $b CRC Press, $c c2019.
300 $a 1 online resource.
490 1 $a Discrete mathematics and its applications
504 $a Includes bibliographical references and index.
520 $a 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.
588 $a Description based on print version record.
650 0 $a Computational complexity. $3 185313
650 0 $a Sampling (Statistics) $3 182291
830 0 $a Discrete mathematics and its applications. $3 328917
856 4 0 $u https://www.taylorfrancis.com/books/9781315266954