On Approximation Complexity of Counting Matchings in Hypergraphs

Reference

Benjamin Cabrera. On approximation complexity of counting matchings in hypergraphs, 2014.

Suggested BibTeX entry:

@misc{cabreraBachelorthesisCS,
    author = {Benjamin Cabrera},
    school = {University of Bonn, Germany},
    title = {On Approximation Complexity of Counting Matchings in Hypergraphs},
    year = {2014}
}



PDF (548 kB)
© University of Duisburg-Essen, Theoretical Computer Science group