The Monotone Complexity of Computing k-Clique on Random Graphs
M. Märtens, The Monotone Complexity of Computing K-Clique on Random Graphs, 2011.
Download
No fulltext has been uploaded.
Mastersthesis
Author
Märtens, Marcus
Supervisor
Department
Publishing Year
LibreCat-ID
Cite this
Märtens M. The Monotone Complexity of Computing K-Clique on Random Graphs.; 2011.
Märtens, M. (2011). The Monotone Complexity of Computing k-Clique on Random Graphs.
@book{Märtens_2011, title={The Monotone Complexity of Computing k-Clique on Random Graphs}, author={Märtens, Marcus}, year={2011} }
Märtens, Marcus. The Monotone Complexity of Computing K-Clique on Random Graphs, 2011.
M. Märtens, The Monotone Complexity of Computing k-Clique on Random Graphs. 2011.
Märtens, Marcus. The Monotone Complexity of Computing K-Clique on Random Graphs. 2011.
Google Scholar