Deciding 1-solvability of distributed task is NP-hard (extended abstract)

  • Authors:
  • Ofer Biran;Shlomo Moran;Shmuel Zaks

  • Affiliations:
  • -;-;-

  • Venue:
  • WG '90 Proceedings of the 16th international workshop on Graph-theoretic concepts in computer science
  • Year:
  • 1991

Quantified Score

Hi-index 0.00

Visualization

Abstract