Distributed Computing FS 2012 Prof. R. Wattenhofer Stephan Holzer

First Page		Document Content
Date: 2014-09-26 08:28:47 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 Source URL: dcg.ethz.ch Download Document from Source Website File Size: 377,04 KB Share Document on Facebook