5 citations · 17 across the 20 of their papers we have counts for
3 papers · 1 filter
From Alternation to FPRAS: Toward a Complexity Classification of Approximate Counting
Markus Hecher, Matthias Lanzinger
Counting problems are fundamental across mathematics and computer science. Among the most subtle are those whose associated decision problem is solvable in polynomial time, yet who…
FPT Parameterisations of Fractional and Generalised Hypertree Width
Matthias Lanzinger, Igor Razgon, Daniel Unterberger
We present the first fixed-parameter tractable (FPT) algorithms for exact computation of generalized hypertree width (ghw) and fractional hypertree width (fhw). Our algorithms are…
Selective Use of Yannakakis' Algorithm to Improve Query Performance: Machine Learning to the Rescue
Daniela Böhm, Georg Gottlob, Matthias Lanzinger +4
Query optimization has played a central role in database research for decades. However, more often than not, the proposed optimization techniques lead to a performance improvement…