Computational Complexity of Counting and Sampling

DOI10.1201/b22024zbMath1423.68010OpenAlexW2920542041MaRDI QIDQ4685131

István Miklós

Publication date: 5 October 2018

Full work available at URL: https://doi.org/10.1201/b22024

zbMATH Keywords

samplingcomputational complexityMarkov chainscountingbioinformaticslinear algebraalgebraic dynamic programmingholographic algorithms\#P-complete problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Combinatorics in computer science (68R05) Dynamic programming (90C39) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Computational methods for problems pertaining to biology (92-08) General topics in the theory of algorithms (68W01) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Enumerative combinatorics (05Axx)

Related Items (1)

A Markov chain on the solution space of edge colorings of bipartite graphs

This page was built for publication: Computational Complexity of Counting and Sampling