From a Static Impossibility to an Adaptive Lower Bound: the Complexity of Early Deciding Set Agreement


Published in:
Proceedings of the 37th ACM Symposium on Theory of Computing (STOC'05), 714-722
Year:
2005
Laboratories:




 Record created 2006-01-30, last modified 2018-06-22

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)