Skip to content

Author

Theophile Thiery

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Open access Oct 2026

Asymptotically Optimal Hardness for \({k}\)-Set Packing and \({k}\)-Matroid Intersection

Abstract. For any [Formula: see text], we prove that [Formula: see text]-Dimensional Matching is hard to approximate within a factor of [Formula: see text] for large [Formula: see text] unless [Formula: see text]. Listed in Karp’s 21 [Formula: see text]-complete problems, [Formula: see text]-Dimensional Matching is a...

Euiwoong Lee, Ola Svensson, Theophile Thiery · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.