Fundamentals of Computation Theory

DOI10.1007/11537311zbMath1123.68142arXivmath/0511202OpenAlexW2491671784MaRDI QIDQ5492913

Magnus Bordewich, Martin Dyer, Marek Karpinski

Publication date: 20 October 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0511202

zbMATH Keywords

hypergraphMarkov chainsGlauber dynamicsmixing timestopping timespath couplinghardness of counting

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Approximation algorithms (68W25) Randomized algorithms (68W20)

This page was built for publication: Fundamentals of Computation Theory