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