Back to Results
First PageMeta Content
NP-complete problems / Dominating set / Chernoff bound / Tango tree / Theoretical computer science / Mathematics / Computational complexity theory


Distributed Computing FS 2012 Prof. R. Wattenhofer Stephan Holzer
Add to Reading List

Document Date: 2014-09-26 08:28:47

Open Document

File Size: 377,04 KB

Share Result on Facebook
UPDATE