Inproceedings,

Deciding 1-sovability of distributed task is NP-hard.

, , and .
WG, volume 484 of Lecture Notes in Computer Science, page 206-220. Springer, (1990)

Meta data

Tags

Users

  • @dblp

Comments and Reviews