Computational complexity of counting and sampling. ([2019])

• Record Type: Book
• Further Information: Note: István Miklós.
• Authors: (Mathematician), Miklós, István
• Contents: 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.
• Publisher Details: Boca Raton, FL : CRC Press, Taylor & Francis Group
• Publication Date: 2019
• Copyright Date: 2019
• Extent: 1 online resource
• Subjects: 511.3/52; Computational complexity; Sampling (Statistics); MATHEMATICS / General; MATHEMATICS / Arithmetic; MATHEMATICS / Combinatorics; Electronic books
• Languages: English
• ISBNs: 9781315266954; 1315266954; 9781351971614; 1351971611; 9781351971591; 9781351971607; 1351971603
• Related ISBNs: 135197159X; 9781138035577; 1138070831; 9781138070837
• Notes: Note: Includes bibliographical references.; Note: Online resource; title from PDF title page (EBSCO, viewed February 26, 2019).
• Access Rights: Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
• Access Usage: Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.