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.

Deciding 1-sovability of distributed task is NP-hard

Ofer Biran, Shlomo Moran, Shmuel Zaks. Deciding 1-sovability of distributed task is NP-hard. In Rolf H. Möhring, editor, Graph-Theoretic Concepts in Computer Science, 16rd International Workshop, WG 90, Berlin, Germany, June 20-22, 1990, Proceedings. Volume 484 of Lecture Notes in Computer Science, pages 206-220, Springer, 1990.

Abstract

Abstract is missing.

runs on