|
|
|
|
| LEADER |
00000cam a2200000 i 4500 |
| 001 |
in00005971840 |
| 003 |
OCoLC |
| 005 |
20220616041512.0 |
| 008 |
181012s2019 flua b 001 0 eng c |
| 010 |
|
|
|a 2018033716
|
| 019 |
|
|
|a 1022085060
|
| 020 |
|
|
|a 9781138035577
|q paperback
|
| 020 |
|
|
|a 1138035572
|q paperback
|
| 020 |
|
|
|a 1138070831
|
| 020 |
|
|
|a 9781138070837
|
| 035 |
|
|
|a (OCoLC)1060183415
|
| 040 |
|
|
|a LBSOR/DLC
|b eng
|e rda
|c DLC
|d OCLCO
|d OCLCF
|d YDX
|d UtOrBLW
|
| 042 |
|
|
|a pcc
|
| 049 |
|
|
|a EEMR
|
| 050 |
0 |
0 |
|a QA267.7
|b .M55 2019
|
| 082 |
0 |
0 |
|a 511.3/52
|2 23
|
| 100 |
1 |
|
|a Miklós, István
|c (Mathematician),
|e author.
|0 http://id.loc.gov/authorities/names/no2018144197
|
| 245 |
1 |
0 |
|a Computational complexity of counting and sampling /
|c István Miklós.
|
| 264 |
|
1 |
|a Boca Raton :
|b CRC Press, Taylor & Francis Group,
|c [2019]
|
| 300 |
|
|
|a xvii, 390 pages ;
|c 23 cm.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a unmediated
|b n
|2 rdamedia
|
| 338 |
|
|
|a volume
|b nc
|2 rdacarrier
|
| 490 |
1 |
|
|a Discrete mathematics and its applications
|
| 504 |
|
|
|a Includes bibliographical references and index.
|
| 505 |
0 |
|
|a Background 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 |
|
|
|a "The purpose of the book is to give a comprehensive and detailed introduction to the computational complexity of counting and sampling. The book will consist of three main topics: I. Counting problems that are solvable in polynomial running time, II. Approximation algorithms for counting and sampling, III. Holographic algorithms"--
|c Provided by publisher.
|
| 650 |
|
0 |
|a Computational complexity.
|0 http://id.loc.gov/authorities/subjects/sh85029473
|
| 650 |
|
0 |
|a Sampling (Statistics)
|0 http://id.loc.gov/authorities/subjects/sh85117056
|
| 650 |
|
7 |
|a Computational complexity.
|2 fast
|0 (OCoLC)fst00871991
|
| 650 |
|
7 |
|a Sampling (Statistics)
|2 fast
|0 (OCoLC)fst01104676
|
| 830 |
|
0 |
|a Discrete mathematics and its applications.
|0 http://id.loc.gov/authorities/names/n97061951
|
| 907 |
|
|
|y .b131839081
|b 190903
|c 190531
|
| 998 |
|
|
|a mn
|b 190806
|c m
|d a
|e -
|f eng
|g flu
|h 0
|i 2
|
| 994 |
|
|
|a 92
|b EEM
|
| 999 |
f |
f |
|i 4de54d5d-dc73-5336-b028-a2fa502bf55b
|s 5ba18fd7-9e1f-5dcb-a47d-cce052f6664e
|t 0
|
| 952 |
f |
f |
|p Can Circulate
|a Michigan State University-Library of Michigan
|b Michigan State University
|c MSU Main Library
|d MSU Main Library
|t 0
|e QA267.7 .M55 2019
|h Library of Congress classification
|i Printed Material
|m 31293036745259
|n 1
|
