Linearity and Unprovability of Set Union Problem Strategies
From MaRDI portal
Publication:4339001
DOI10.1006/jagm.1996.0815zbMath0874.68135OpenAlexW2089591958MaRDI QIDQ4339001
Jaroslav Nešetřil, Martin Loebl
Publication date: 4 June 1997
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1996.0815
Related Items
Epidemiography. II: Games with a dozing yet winning player ⋮ The longest common substring problem ⋮ An Unprovable Ramsey-Type Theorem