External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Linearity and Unprovability of Set Union Problem Strategies

Martin Loebl, Jaroslav Nesetril. Linearity and Unprovability of Set Union Problem Strategies. In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, 2-4 May 1988, Chicago, Illinois, USA. pages 360-366, ACM, 1988.

Abstract

Abstract is missing.

runs on