scientific article; zbMATH DE number 6820234
From MaRDI portal
Publication:4598184
DOI10.4230/LIPIcs.ICALP.2016.45zbMath1388.68300arXiv1510.09193MaRDI QIDQ4598184
Ivona Bezáková, Daniel Štefanković, Leslie Ann Goldberg, Andreas Galanis, Heng Guo
Publication date: 19 December 2017
Full work available at URL: https://arxiv.org/abs/1510.09193
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Hypergraphs (05C65) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25)
Related Items
The complexity of approximately counting in 2-spin systems on \(k\)-uniform bounded-degree hypergraphs ⋮ Perfect sampling for Gibbs point processes using partial rejection sampling ⋮ Counting hypergraph matchings up to uniqueness threshold
This page was built for publication: