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