@InProceedings{gan_et_al:LIPIcs.ICALP.2022.64,
author = {Gan, Luyining and Han, Jie},
title = {{The Decision Problem for Perfect Matchings in Dense Hypergraphs}},
booktitle = {49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)},
pages = {64:1--64:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-235-8},
ISSN = {1868-8969},
year = {2022},
volume = {229},
editor = {Boja\'{n}czyk, Miko{\l}aj and Merelli, Emanuela and Woodruff, David P.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.64},
URN = {urn:nbn:de:0030-drops-164057},
doi = {10.4230/LIPIcs.ICALP.2022.64},
annote = {Keywords: Computational Complexity, Perfect Matching, Hypergraph}
}