Linearity and Unprovability of Set Union Problem Strategies

DOI10.1006/JAGM.1996.0815MaRDI QIDQ4339001zbMATH OpenOpenAlexFDO

Authors Martin Loebl, J. Nešetřil

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

zbMATH Keywords

strong postorder path compression systems

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cited in

(3)

• Epidemiography. II: Games with a dozing yet winning player
• The longest common substring problem
• An Unprovable Ramsey-Type Theorem

This page was built for publication: Linearity and Unprovability of Set Union Problem Strategies

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