{"supervisor":[{"last_name":"Blömer","full_name":"Blömer, Johannes","id":"23","first_name":"Johannes"}],"date_updated":"2022-01-06T06:58:44Z","title":"The Monotone Complexity of Computing k-Clique on Random Graphs","date_created":"2018-05-25T09:46:27Z","status":"public","_id":"2902","user_id":"25078","year":"2011","author":[{"first_name":"Marcus","last_name":"Märtens","full_name":"Märtens, Marcus"}],"type":"mastersthesis","citation":{"mla":"Märtens, Marcus. *The Monotone Complexity of Computing K-Clique on Random Graphs*. 2011.","chicago":"Märtens, Marcus. *The Monotone Complexity of Computing K-Clique on Random Graphs*, 2011.","apa":"Märtens, M. (2011). *The Monotone Complexity of Computing k-Clique on Random Graphs*.","short":"M. Märtens, The Monotone Complexity of Computing K-Clique on Random Graphs, 2011.","bibtex":"@book{Märtens_2011, title={The Monotone Complexity of Computing k-Clique on Random Graphs}, author={Märtens, Marcus}, year={2011} }","ieee":"M. Märtens, *The Monotone Complexity of Computing k-Clique on Random Graphs*. 2011.","ama":"Märtens M. *The Monotone Complexity of Computing K-Clique on Random Graphs*.; 2011."},"department":[{"_id":"64"}]}