Approximately Sampling Elements with Fixed Rank in Graded Posets

DOI10.1137/1.9781611974782.119zbMath1410.68395arXiv1611.03385OpenAlexW3098825312MaRDI QIDQ4575865

Matthew Fahrbach, Prateek Bhakta, Dana Randall, Ben Cousins

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Combinatorial aspects of partitions of integers (05A17) Combinatorics of partially ordered sets (06A07) Approximation algorithms (68W25)

Related Items (1)

Beyond windability: approximability of the four-vertex model

This page was built for publication: Approximately Sampling Elements with Fixed Rank in Graded Posets