Stopping Times, Metrics and Approximate Counting
From MaRDI portal
Publication:3613753
DOI10.1007/11786986_11zbMath1223.68075OpenAlexW2152324554WikidataQ56323910 ScholiaQ56323910MaRDI QIDQ3613753
Magnus Bordewich, Martin Dyer, Marek Karpinski
Publication date: 12 March 2009
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11786986_11
Analysis of algorithms and problem complexity (68Q25) Random graphs (graph-theoretic aspects) (05C80) Stopping times; optimal stopping problems; gambling theory (60G40) Randomized algorithms (68W20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (4)
Inapproximability of counting independent sets in linear hypergraphs ⋮ Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width ⋮ Approximation via Correlation Decay When Strong Spatial Mixing Fails ⋮ Counting Hypergraph Colorings in the Local Lemma Regime
This page was built for publication: Stopping Times, Metrics and Approximate Counting
