Benjamin Rossman. On the constant-depth complexity of k-clique. In Richard E. Ladner, Cynthia Dwork, editors, Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008. pages 721-730, ACM, 2008. [doi]
@inproceedings{Rossman08,
title = {On the constant-depth complexity of k-clique},
author = {Benjamin Rossman},
year = {2008},
doi = {10.1145/1374376.1374480},
url = {http://doi.acm.org/10.1145/1374376.1374480},
researchr = {https://researchr.org/publication/Rossman08},
cites = {0},
citedby = {0},
pages = {721-730},
booktitle = {Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008},
editor = {Richard E. Ladner and Cynthia Dwork},
publisher = {ACM},
isbn = {978-1-60558-047-0},
}