Approximate Counting of Matchings in Sparse Uniform Hypergraphs
Approximate Counting of Matchings in Sparse Uniform Hypergraphs
Previous chapter Next chapter Full AccessProceedings 2013 Proceedings of the Meeting on Analytic Algorithmics and Combinatorics (ANALCO)Approximate Counting of Matchings in Sparse Uniform HypergraphsMarek Karpinski, Andrzej Rucinski, and Edyta SzymanskaMarek Karpinski, Andrzej Rucinski, and Edyta Szymanskapp.72 - 79Chapter DOI:https://doi.org/10.1137/1.9781611973037.9PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAboutAbstract In this paper we give …