Citace podle APA (7th ed.)

Coja-Oghlan, A., Krivelevich, M., & Vilenchik, D. (2007). Why almost all satisfiable $k$-CNF formulas are easy. Discrete mathematics and theoretical computer science, DMTCS Proceedings vol. AH,...(Proceedings), 95-108. https://doi.org/10.46298/dmtcs.3538

Citace podle Chicago (17th ed.)

Coja-Oghlan, Amin, Michael Krivelevich, a Dan Vilenchik. "Why Almost All Satisfiable $k$-CNF Formulas Are Easy." Discrete Mathematics and Theoretical Computer Science DMTCS Proceedings vol. AH,..., no. Proceedings (2007): 95-108. https://doi.org/10.46298/dmtcs.3538.

Citace podle MLA (9th ed.)

Coja-Oghlan, Amin, et al. "Why Almost All Satisfiable $k$-CNF Formulas Are Easy." Discrete Mathematics and Theoretical Computer Science, vol. DMTCS Proceedings vol. AH,..., no. Proceedings, 2007, pp. 95-108, https://doi.org/10.46298/dmtcs.3538.

Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..