Filling Crosswords is Very Hard

DOI10.4230/LIPICS.ISAAC.2021.48arXiv2310.10815OpenAlexW4317401272MaRDI QIDQ6147555

Author name not available (Why is that?)

Publication date: 15 January 2024

Full work available at URL: https://arxiv.org/abs/2310.10815

zbMATH Keywords

matchinglower boundsstreaming algorithmsparameterized algorithms

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

Nearly time-optimal kernelization algorithms for the line-cover problem with big data

This page was built for publication: Filling Crosswords is Very Hard

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6147555)