000 03750cam a2200577Ii 4500
001 9781315266954
003 FlBoTFG
005 20220531132507.0
006 m o d
007 cr cnu|||unuuu
008 190225t20192019flu ob 000 0 eng d
040 _aOCoLC-P
_beng
_erda
_epn
_cOCoLC-P
020 _a9781315266954
_q(electronic bk.)
020 _a1315266954
_q(electronic bk.)
020 _a9781351971614
_q(electronic bk.)
020 _a1351971611
_q(electronic bk.)
020 _a9781351971591
_q(electronic bk. : Mobipocket)
020 _a135197159X
_q(electronic bk. : Mobipocket)
020 _a9781351971607
_q(electronic bk. : EPUB)
020 _a1351971603
_q(electronic bk. : EPUB)
020 _z9781138035577
020 _z1138070831
020 _z9781138070837
035 _a(OCoLC)1088407366
_z(OCoLC)1088909438
_z(OCoLC)1089142449
_z(OCoLC)1089435126
_z(OCoLC)1089486057
035 _a(OCoLC-P)1088407366
050 4 _aQA267.7
072 7 _aMAT
_x000000
_2bisacsh
072 7 _aMAT
_x004000
_2bisacsh
072 7 _aMAT
_x036000
_2bisacsh
072 7 _aUMB
_2bicssc
082 0 4 _a511.3/52
_223
100 1 _aMiklós, István
_c(Mathematician),
_eauthor.
245 1 0 _aComputational complexity of counting and sampling /
_cIstván Miklós.
264 1 _aBoca Raton, FL :
_bCRC Press, Taylor & Francis Group,
_c[2019]
264 4 _c©2019
300 _a1 online resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
490 1 _aDiscrete mathematics and its applications
505 0 _aBackground on computational complexity -- Algebraic dynamic programming and monotone computations -- Linear algebraic algorithms. The power of subtracting -- #P-complete counting problems -- Holographic algorithms -- Methods of random generations -- Mixing of Markov chains and their applications in the theory of counting and sampling -- Approximable counting and sampling problems.
520 _aComputational 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 _aOCLC-licensed vendor bibliographic record.
650 0 _aComputational complexity.
650 0 _aSampling (Statistics)
650 7 _aMATHEMATICS / General.
_2bisacsh
650 7 _aMATHEMATICS / Arithmetic
_2bisacsh
650 7 _aMATHEMATICS / Combinatorics
_2bisacsh
856 4 0 _3Taylor & Francis
_uhttps://www.taylorfrancis.com/books/9781315266954
856 4 2 _3OCLC metadata license agreement
_uhttp://www.oclc.org/content/dam/oclc/forms/terms/vbrl-201703.pdf
999 _c73092
_d73092